{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"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":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"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":"microsandbox_runtime::lib::runner::relay::client_reader_task (cyclomatic 119): microsandbox_runtime::lib::runner::relay::client_reader_task has cyclomatic complexity 119 (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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"06958ba0cb917f74f3f0778ca0bec86127224ba9b7a97acf0a4cb16734727100"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::handle_message_with_charge (cyclomatic 114): microsandbox_agentd::lib::agent::handle_message_with_charge has cyclomatic complexity 114 (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":"crates/agentd/lib/agent.rs"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3f26e834da3e3cc9c41a09c607966eec26226971da0cd7f3750a580bcb0eff"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::run (cyclomatic 100): microsandbox_agentd::lib::agent::run has cyclomatic complexity 100 (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":"crates/agentd/lib/agent.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5871032a55ecd9324046c7722027fcf1ee6fb60176f446473f48ca7762e3038"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::sandbox_builder_from_args (cyclomatic 86): microsandbox_py::helpers::sandbox_builder_from_args has cyclomatic complexity 86 (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":"sdk/python/src/helpers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e11d8692afb10da17c0f62df15bd47ae3ec962b214d8c1b06523e46ea4abf82"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::build_vm (cyclomatic 80): microsandbox_runtime::lib::runner::vm::build_vm has cyclomatic complexity 80 (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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"58761efc0bb66f9290ac793a73add7f0c828f8f3bf350ae0ca04ff9cfd56c3d3"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::run (cyclomatic 79): microsandbox_runtime::lib::runner::vm::run has cyclomatic complexity 79 (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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31deaf9ec14e0d27d506fca198a4bab693157b1152f2d4667a8378e8539b733"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::msb_sandbox_create (cyclomatic 63): microsandbox_go::msb_sandbox_create has cyclomatic complexity 63 (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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a457a5c3b05bd0e3a77b49e600dc011ba1ab1f455f1ef6855eb1803fa04fd69"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::apply_mount (cyclomatic 55): microsandbox_py::helpers::apply_mount has cyclomatic complexity 55 (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":"sdk/python/src/helpers.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e290c7a48aa286c511101cefc37208296d5a70ffee76af6bd4acd941efec1"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeControlExecutor::execute_locked (cyclomatic 52): RuntimeControlExecutor::execute_locked has cyclomatic complexity 52 (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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b140d3a2055195be9cd69ff53ac752db0336dd7eed2ae655194961b39397d4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::request (cyclomatic 52): JobManager::request has cyclomatic complexity 52 (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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"db40adca3e6a867c48b964b14fa34c6751dc2546b19030a3197265b2471ffea6"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalBackend::launch_sandbox (cyclomatic 52): LocalBackend::launch_sandbox has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"23defdbdfcc26eec0954050302c1b591b1cb4be4e97fe00ecf3130e4bb8be7da"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::volume_mount (cyclomatic 50): microsandbox_go::volume_mount has cyclomatic complexity 50 (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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb99a4b02414ecff083d621b925385412897f89f41c6e882da019a6faae56e55"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::discover (cyclomatic 49): microsandbox::lib::runtime::storage_aliases::discover has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8b962391a5a21211503067ebbf02a6d743144ab1021af0bd98990cb0b1aaba"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::tcp::relay_tcp_session (cyclomatic 48): microsandbox_agentd::lib::tcp::relay_tcp_session has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/tcp.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b3e32676337b1356c39915fa85459130ddf517388835bcac4a52b356f857a"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpProxy::try_run (cyclomatic 48): TcpProxy::try_run has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d996ac114834ffa3e47baf068e7daf4ced20da557f676220dec4be0988a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner (cyclomatic 47): microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner has cyclomatic complexity 47 (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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3859a2efe3b4ed5bd4563ec963439eefcb916fca59125d7999095bbeea4490fe"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::restore_builder_from_args (cyclomatic 47): microsandbox_py::helpers::restore_builder_from_args has cyclomatic complexity 47 (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":"sdk/python/src/helpers.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d357e0fc8ed897adfefc40e5ee6f2dffad7da7143034d436a8c665287144c91"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::apply_network (cyclomatic 46): microsandbox_py::helpers::apply_network has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec453a70e3d41425603e199c6b44865be5b794996bbfd87cd8979638386cb1c"}},{"ruleId":"D1","level":"warning","message":{"text":"MountConfig._to_dict (cyclomatic 46): MountConfig._to_dict has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/microsandbox/types.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e33975b88a94361247de97d3a66f6a89b52165e2c54f998f807a4614d74709"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::apply_network_opts (cyclomatic 45): microsandbox_cli::lib::commands::common::apply_network_opts has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"52689718e7f97ce62aa72230798246c4eef0c374756b56357ebc17a49f6cb7fb"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_ruby::apply_builder_options (cyclomatic 44): microsandbox_ruby::apply_builder_options has cyclomatic complexity 44 (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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f8778eefc45a26756ef32ad0343bbd40eedba001ed488d265ae6f62db4c347"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename (cyclomatic 43): microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename has cyclomatic complexity 43 (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":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06e570cda3d3d1e30b9e2812e4097f07c47f4b254115dc30686231437ce7b26"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::run (cyclomatic 43): JobManager::run has cyclomatic complexity 43 (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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b9b752cd91fb1b619b8f81f0c93f3943ff546ad6a2469b24d75987a1586f4"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::parse_cli_mount_options (cyclomatic 42): microsandbox_cli::lib::commands::common::parse_cli_mount_options has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d2260b09eba5244adcb5f62afd94d562df42691b25d2c68a3f167d5a8c9620"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointCoordinator::capture_paused (cyclomatic 42): CheckpointCoordinator::capture_paused has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ba1275050884f5f3af45bcb2e5867a9089d1dbca0be939208fc3ceff71e201"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::apply_network (cyclomatic 41): microsandbox_go::apply_network has cyclomatic complexity 41 (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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d39001f511e8f425e20faa0da7dccb2e3f01fbc1dd0a10728a1f38a05e2f11"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_network_patch (cyclomatic 39): microsandbox_cli::lib::sandbox_config::materialize_network_patch has cyclomatic complexity 39 (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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"908512396b76a2ca7371d1ff233b6649cf01b2647e081b24f4bf7e4b4069eb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop (cyclomatic 38): microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop has cyclomatic complexity 38 (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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1bf1308e000a766618ea469d455d92c284d23231a208cd4dbf6c9004539527"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr (cyclomatic 37): microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30fc93b3011f22d4c24e9a7013cbc01285a1e6820fff7f3941aad778ccaa5e"}},{"ruleId":"D1","level":"warning","message":{"text":"PatchField::parse (cyclomatic 37): PatchField::parse has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b71b9d08ef482575e8f28d8eca547de080c61ca81b94df63318f32ae90af1e"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::cloud::sandbox::reject_dropped_cloud_create_fields (cyclomatic 37): microsandbox::lib::backend::cloud::sandbox::reject_dropped_cloud_create_fields has cyclomatic complexity 37 (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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"daee2770aecbef611c4dd02fc1e955c18c17538074d4e416d0c64df275283d26"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::batch::load (cyclomatic 37): microsandbox::lib::backend::local::snapshot::archive::batch::load has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/batch.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a892d90b24800c9663df7e2ddf42cd93a5c3a3041a356f9c340f1f9c56484f"}},{"ruleId":"D1","level":"warning","message":{"text":"Network._to_dict (cyclomatic 37): Network._to_dict has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/microsandbox/types.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9132f82e844019b3ec0aa08b7072a05a6017165060f04ad7b84025f314d8c1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointCoordinator::capture_to (cyclomatic 36): CheckpointCoordinator::capture_to has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5ade7351f420f3a43765838d74b6bdce1e2cb66439a4b52cdd134ac8c4396"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::recovery_views (cyclomatic 36): microsandbox_runtime::lib::checkpoint::migration::source::recovery_views has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8850583010bfe6ad5ce6f81927b932b51fa29682ac5c7766490253a58b82295"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::parse_mount_spec (cyclomatic 36): microsandbox_runtime::lib::runner::vm::parse_mount_spec has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec44977c1671d310f2df779d9055c906cb83bce38e9b951735868fe86f3f8158"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::jobs::dispatch (cyclomatic 36): microsandbox_go::jobs::dispatch has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/jobs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6b0ae2f7245bc7007e344dec089aff0a99f7e55808a5d07bd9c552d90eae6f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::error::to_py_err (cyclomatic 36): microsandbox_py::error::to_py_err has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/error.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4840b4a78bd3c97993f4c3aa0bf57d1233cdf05a938663455957da2111746fc"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::bin::run_async_command_anyhow (cyclomatic 34): microsandbox_cli::bin::run_async_command_anyhow has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/bin/main.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7ddd2f1034e01674cdadabe72a6b4a7610baae574a945f63310e8fda3330e2"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db (cyclomatic 34): microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71b85acfe32aacbc4051fbfd4bae790388039e3276dd57b39b6550ca4b2156b"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::inspect::run (cyclomatic 33): microsandbox_cli::lib::commands::inspect::run has cyclomatic complexity 33 (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":"crates/cli/lib/commands/inspect.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b793bfff1f8d1f5b38a98f00d42470c9a7bf8ddc68496e13804f87f72c15ca67"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::ring_writer_task (cyclomatic 33): microsandbox_runtime::lib::runner::relay::ring_writer_task has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ac8c696aa857495c06c5027efa967bfcaedb2cfa70b06446bf3f749cf2aa27"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContract::to_previous_version (cyclomatic 33): LaunchContract::to_previous_version has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad6f318a32cae729344acbbd42aa1d78e83ae98a310d670e109403a96009d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::prepare_docker_archive (cyclomatic 32): microsandbox_image::lib::archive::docker::prepare_docker_archive 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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"47753ce516814b9840d34e0f97fc327afab0ee0ec9149ee5eb53b951d5cd7d17"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory (cyclomatic 32): microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce226eabbe52b8c7c76b3867e285a8149b40adc872dd1f443f9e5025b03a80"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretsHandler::substitute_ready (cyclomatic 31): SecretsHandler::substitute_ready has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f4386cc5a6667b1ecea470bae72cfa09d0b507f7e7f8dc2415abbe80491604"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::runtime::launch_input::legacy_env (cyclomatic 31): microsandbox::lib::runtime::launch_input::legacy_env has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_input.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d766e39226541c21c5b2dfee4146de95902c855c40d2d76a484c4dfe4e75df2"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_mount_object (cyclomatic 30): microsandbox_cli::lib::sandbox_config::materialize_mount_object has cyclomatic complexity 30 (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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6c278fe28c58618c603c74d64f2e5c53d6fb85ae0767f0669e1b4a26680b27"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry::materialize_layer_stage (cyclomatic 30): Registry::materialize_layer_stage has cyclomatic complexity 30 (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":"crates/image/lib/registry/client.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0154f9002633ba21a8a34aac56ac60d69cdc691e934ac6dc0512e26356f6a00"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner (cyclomatic 30): microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e666d062b5e938d4308f724e7b0880e03f84d854990102af6702edce289d2f0"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::route_guest_lane_frame (cyclomatic 30): microsandbox_runtime::lib::runner::relay::route_guest_lane_frame has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3991}}}],"partialFingerprints":{"codehealthFindingId/v1":"74073a6156e2991ee2d23c37f0ebfb01db676fd66852dc673c235a64a32d1633"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::bulk_writer_task (cyclomatic 28): microsandbox_agentd::lib::agent::bulk_writer_task has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bae69309d2d5d9b75c1a450b42e49420f5629f601fa2d0a44a66f746cec0c12"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::prepare_oci_archive (cyclomatic 28): microsandbox_image::lib::archive::docker::prepare_oci_archive has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc430caa0c05136099779cfbd5ea64d8c3779f492d489f1322dfec4561e996c7"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resizer::parse_and_validate (cyclomatic 28): microsandbox_image::lib::ext4::resizer::parse_and_validate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"28abbd8f001642da0333084fc7fcee29988058a27e2a7e812206efd5f6b46443"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRelay::run (cyclomatic 28): AgentRelay::run has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25d866823d86bc97be739148434b714016ed85e89b57630b2d1874a1a62f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::restore::builder (cyclomatic 28): microsandbox_go::restore::builder has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/restore.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ea921accb8b396829912e113874f1e0c1dbc4aaa078fc941914ca68f4cd49"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory (cyclomatic 28): microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ecf387e291d457d4446fdeaa73782ec8a4c098dda592cacb37ff85cb7b733"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::runtime::spawn::machine_cli_args (cyclomatic 28): microsandbox::lib::runtime::spawn::machine_cli_args has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5897d3e754178125aa13e789bd12505a5d5ecfa7f0d7ff99f38a3c5dfc9a69"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::fs::handle_fs_request (cyclomatic 27): microsandbox_agentd::lib::fs::handle_fs_request has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0623f79c7f75d83760adc5781d914242af6df75704f4e2e87f3a06129934570"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::select (cyclomatic 27): microsandbox_runtime::lib::checkpoint::migration::source::select has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f414b247f58c1e3928badb5c4453e6fd4e6078eca454346d34d384d8e03e7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::ring_reader_task (cyclomatic 27): microsandbox_runtime::lib::runner::relay::ring_reader_task has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9c40c64f0b405cf97b1d2a8bf0770ca7525f6cfd28d163600dd0934a47238"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::parse_network_policy (cyclomatic 27): microsandbox_py::helpers::parse_network_policy has cyclomatic complexity 27 (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":"sdk/python/src/helpers.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fafa7756dbb3e9aa74eeaf635a9d75c66faa6df71ab54701a9e49ce1c65cb78"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::sandbox::apply_exec_options (cyclomatic 27): microsandbox_py::sandbox::apply_exec_options has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aa0908200ebea2a17469b15c2acf6ef98fa6abc68580f728a8450bf1459a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalBackend::materialize_archive_for_child (cyclomatic 27): LocalBackend::materialize_archive_for_child has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc05187d4ed457482b933ed9ad46511c9f7ff2f2f6557732029b3be230db983e"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings (cyclomatic 27): microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4689cedca22122c04a4b5dbef18eb5e7ff4e2b1cc1990c16fc5a49e4c676b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecSession::spawn_pty (cyclomatic 26): ExecSession::spawn_pty has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb2a3844bf64a465e5feb2aaa443221b6c6370015b90fddb954fef883bde6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::run_fs_bulk_write_worker (cyclomatic 26): microsandbox_agentd::lib::agent::run_fs_bulk_write_worker has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71170afa1e7b09a92a2debebd4088205ab128a88caccf5a8e844ae940c68b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::config::validate_guest_bootstrap (cyclomatic 26): microsandbox_agentd::lib::config::validate_guest_bootstrap has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/config.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a6fc936f7fb511d4e3ddcf7f5545e2857cf1ba3332f1273741d0aed45b884"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_config_patch (cyclomatic 26): microsandbox_cli::lib::sandbox_config::materialize_config_patch has cyclomatic complexity 26 (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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecc78bb6a44276268d458ee1c706b1dac41aa3dcc51b6888a4f045b81ef2522"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestFrameMerger::push (cyclomatic 26): GuestFrameMerger::push has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccb74c3ddcaa01d162bff1d5b21e6a7632be00431620c39449c67db45c60872"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_node::native::network_policy_builder::apply_rule_ops (cyclomatic 26): microsandbox_node::native::network_policy_builder::apply_rule_ops has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_policy_builder.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5a3a6ac8b8b1d2ff29082838a39dc822cb5e4cba8f45e8994827a706ef094"}},{"ruleId":"D1","level":"warning","message":{"text":"SandboxOpts::build_network_policy (cyclomatic 25): SandboxOpts::build_network_policy has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5b0b0cfc8f098c0f07ed9e23d7070a34a978f6d843076f1736963cf9226b31"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::parse_secret (cyclomatic 25): microsandbox_cli::lib::commands::common::parse_secret has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcecb7b93786eae720e545ee4bd95a197e143246a837d0903dc89e4ed2dc570"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::machine_cmd::run (cyclomatic 25): microsandbox_cli::lib::machine_cmd::run has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"707c6f3772ccae79e1946089fe4a05224376adb86c314b80a424a4c8441becd2"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename (cyclomatic 25): microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ec369be4917876e96c4a6417e26ce7dfc07b256d53440f66300477809a15b3"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::layout::reject_advanced_legacy_storage (cyclomatic 25): microsandbox_runtime::lib::checkpoint::layout::reject_advanced_legacy_storage has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"534af2a6e88204d72c1e9b1e5f1dab86d757423cffd05bea093f0e84aeb07172"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::validate_shape (cyclomatic 24): microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::validate_shape has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08a8130d30b5fe4634696e7944dfc3b20024ba2340e68c56a16799908ab7eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::tar::ingest::ingest_tar (cyclomatic 24): microsandbox_image::lib::tar::ingest::ingest_tar has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7180b8b8385392dc9f685ee2e9db9112bac015677ebdae3bc45fd0682f04210a"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments (cyclomatic 24): microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics-collector/lib/exporters/otel.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521220f252fdebb26b62d5eff5d5e009f988546cdaf87686cff3b265d2b4964"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointCoordinator::capture_disk (cyclomatic 24): CheckpointCoordinator::capture_disk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"012ae76ccec134a39a12ea9bdb94301a115beb18fe056dda7c8f19848f08f294"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedCleanup::prepare (cyclomatic 24): PreparedCleanup::prepare has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/image/cleanup.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3141017987e5802c12b5c00aaf8c440ed4ae3bcc9a57b58407d4f23ae32f17fb"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::deletion::recover_parent (cyclomatic 24): microsandbox::lib::backend::local::snapshot::deletion::recover_parent has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f474269331efb23d7defd9a86d8b96862e8bc62c3a775a4829dfd1aca78fd996"}},{"ruleId":"D1","level":"warning","message":{"text":"SandboxOpts::build_outbound_proxy (cyclomatic 23): SandboxOpts::build_outbound_proxy has cyclomatic complexity 23 (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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1c944e810f83ec55041196ab3929746d6d6f5a5b2f6061ae618c65a06a6cce"}},{"ruleId":"D1","level":"warning","message":{"text":"PullProgressDisplay::handle_event (cyclomatic 23): PullProgressDisplay::handle_event has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/ui.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef8838e2fa7a35a0cef08c2933fcfc8ea3c86919af9593f99e1832d63273a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::run::run_new (cyclomatic 23): microsandbox_cli::lib::commands::run::run_new has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/run.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609866addf7ffee742e07724f7a21c6e22f2efd0f1edd7afd001e6e6a1d686e"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretsHandler::substitute (cyclomatic 23): SecretsHandler::substitute has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"157cea06f002cc85af0b9097ae7098174290b9c80a252c70f08d09f8f3f2ac09"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalBackend::verified_metrics (cyclomatic 23): LocalBackend::verified_metrics has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/metrics_lookup.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"692550686b5b5d8fefd6b73815ce6bf48bea3bb1bf04a932d7c4a50ccf41c0f4"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl (cyclomatic 23): microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3e4d1c81b2ac6e5856503e63feb57337f2589b920ed3efbbad86064538795"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::config::parse_mount_options (cyclomatic 22): microsandbox_agentd::lib::config::parse_mount_options has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/config.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f06efe2efe42ac39867866091bc197c0094a08feb08f01bed5d710a2d6c8d47"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename (cyclomatic 22): microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a16602de00d23d9e4d239773bd9667576d49cd8193f9569f2ea67972ecabe7"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::local_memory_budget::limit_cgroups (cyclomatic 22): microsandbox_runtime::lib::checkpoint::local_memory_budget::limit_cgroups has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/local_memory_budget.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a40c4be56780476415b816828e69d2a2fa588d9726a98bca053877a78e355aa"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::account_aliases (cyclomatic 22): microsandbox_runtime::lib::checkpoint::migration::source::account_aliases has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c358006200e2333eebae002882c15ae2f3d2e9cb82175695c44025d7bfcf8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current (cyclomatic 22): microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7677536017ce394ab54a15ad0049d01c13d7bc6444b4ad37e2a4a76d2907e69c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::msb_sandbox_handle_lifecycle (cyclomatic 22): microsandbox_go::msb_sandbox_handle_lifecycle has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: FfiError::from (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef7f779f4fd2343b7a52b206b132e953c7faad9f741c264844ce980137671d"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::archive_entry_target (cyclomatic 22): microsandbox::lib::backend::local::snapshot::archive::archive_entry_target has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf705b81767f6ab5685bf75c5d8b02f9a3ea7685fe3409922affea5e7df951c5"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::downgrade::load_candidate (cyclomatic 22): microsandbox::lib::backend::local::snapshot::downgrade::load_candidate has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2912f8b61e6073784363cdb55620df77374b2c562173bfd520bfc8c4751e06a"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox.validateOwnedMounts (cyclomatic 22): microsandbox.validateOwnedMounts has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/owned_mount.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1438acdbb8a66b03c252ec79d48a1fd18c7e37a9e361c638915e474479117e05"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::jobs::attach (cyclomatic 21): microsandbox_cli::lib::commands::jobs::attach has cyclomatic complexity 21 (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":"crates/cli/lib/commands/jobs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21eb530fab6ec72a0a5e92ae9b183f2cb3166f87b3f78d0bf06e6b0156076a7"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::storage_doctor::write_diagnosis (cyclomatic 21): microsandbox_cli::lib::commands::self_cmd::storage_doctor::write_diagnosis has cyclomatic complexity 21 (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":"crates/cli/lib/commands/self_cmd/storage_doctor.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0949fbda2440bab2a96f92af7a455023137b5945f114a3d8d2eff6cee620ce45"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_db::lib::compat::v0_6_5::config::to_current (cyclomatic 21): microsandbox_db::lib::compat::v0_6_5::config::to_current 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":"crates/db/lib/compat/v0_6_5/config.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38fabb4ec30d45fedf551ec7be637d2e49e0a5706cf335ea1b2e981c90ff6e2"}},{"ruleId":"D1","level":"warning","message":{"text":"PassthroughFs::do_setattr (cyclomatic 21): PassthroughFs::do_setattr 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":"crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe030144dca6ddb3c94daf9301615b2654d36e62a14634ea3574f8b03b0fef7"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::mobility::validate_shape (cyclomatic 21): microsandbox_filesystem::lib::backends::passthroughfs::unix::mobility::validate_shape 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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fe0690536781cd7f582224677516bde066cc86c2f50d2465f9c8ba63e3e56e"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::lane_reader_task (cyclomatic 21): microsandbox_runtime::lib::runner::relay::lane_reader_task 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33525b4a6e992a4df66cad401dd69e96c67fe2ae5d6036416f1b549fe79ebbf"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::apply_root_disk (cyclomatic 21): microsandbox_go::apply_root_disk 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. This is NOT this file\u0027s highest cyclomatic complexity: FfiError::from (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a3beaa19233059f212c6b73105507c157d23c3bcdae153a0695180e104d22"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox.buildFFICreateOptions (cyclomatic 21): microsandbox.buildFFICreateOptions has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/sandbox.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f092f0194b2a06d0c1b2ad6e14fddf2246268c7a9263ac397d1d9401d78792"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode (cyclomatic 20): microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f453dfdc041e816e53cc36a3c68bd1864fc7e76013b9e7e14493fdb3967ae096"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resizer::grow_storage (cyclomatic 20): microsandbox_image::lib::ext4::resizer::grow_storage 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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a312efa3ab6bcf84cea16937390d2d033544529a79670805aabbe8fc02aff9c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DnsForwarder::forward_query (cyclomatic 20): DnsForwarder::forward_query 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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"93731e7eb592bf1f656d7b495fc705016bc8f5f17ff3828732f6694394d595aa"}},{"ruleId":"D1","level":"warning","message":{"text":"JobManager::start (cyclomatic 20): JobManager::start has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e60a416f11bca04d052a3b79d42bef1ab24e4190e5ab7c7bf565ef4557a2e6"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRelay::thaw_restored_workload (cyclomatic 20): AgentRelay::thaw_restored_workload 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"065eba6b7180656466193090af66e459a9505fc6efae693e57bbe994379f4ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates (cyclomatic 20): microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates 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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9793263e9891254ac1361ac6926fdc755a3bb040d709e9af06c4b8ba6e73dae8"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::bulk_ring_writer_task (cyclomatic 20): microsandbox_runtime::lib::runner::relay::bulk_ring_writer_task 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed15375dbdfdfd324d12e2b1d52354d1f272c80b9bd16f3768cdf2b54f6ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataReader::read_metadata (cyclomatic 20): MetadataReader::read_metadata 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":"sdk/rust/lib/backend/local/snapshot/archive/inspect.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6df2ba9d4483905290ea6c8d3cfe98d249a4df0840fae437e08f09752572e4"}},{"ruleId":"D1","level":"warning","message":{"text":"wire.itemEnd (cyclomatic 20): wire.itemEnd 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":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6294fe00daad41c2a61cfb826a37670d1ce98c4356b76e0533977c2eb50db3"}},{"ruleId":"D1","level":"warning","message":{"text":"Failure::from_message (cyclomatic 19): Failure::from_message has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd/repair/report.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec83ad16a76e2589d9751ac64631f6bf5e1f32f5fa55aba1d51c8c40c817614"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnedDirectorySnapshot::validate (cyclomatic 19): OwnedDirectorySnapshot::validate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6afd542b14d644cadab3c8cab60b07ce10ea996e78b9b941b3b3a3fcd6bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::erofs::writer::write_data_for_tree (cyclomatic 19): microsandbox_image::lib::erofs::writer::write_data_for_tree has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30402e8259b0bff1d7845e90757b0e0ef2f578e08223cf2288d45947b6cce91"}},{"ruleId":"D1","level":"warning","message":{"text":"UdpRelay::relay_direct_session (cyclomatic 19): UdpRelay::relay_direct_session has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f68a3c2add84280b4ed4c467b1437667733e309529c3786c14205bb9b94a004"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::control::handler::operation_to_legacy (cyclomatic 19): microsandbox_runtime::lib::runner::control::handler::operation_to_legacy has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/control/handler.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8799ebba3be2f19414d5230864aee709e5d2ad2abcbc5f9dc65641ea56f8de"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::client_writer_task (cyclomatic 19): microsandbox_runtime::lib::runner::relay::client_writer_task has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cdfdc3322277d1f43bd481026a30840c73b52183e7f0a64fd8511aa29b7f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_go::volume_fs::local_dispatch (cyclomatic 19): microsandbox_go::volume_fs::local_dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/volume_fs.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd8b2912368bfbb319cce3731dee9bb6c7b35f2e9f01f6f5b322f15a79db398"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSession.exchange (cyclomatic 19): JsonSession.exchange has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-session.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0c17392c94c358afde7732f19657ec3798b6ac6898df4d13edf327b0763e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeBuilder::format_arg (cyclomatic 18): TreeBuilder::format_arg 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":"crates/cli/lib/tree.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bdb249b62a82dc9819b876b608fd96ca390b4fc82779a3394496a4c21a6238"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::modify::replayed_args (cyclomatic 18): microsandbox_cli::lib::commands::modify::replayed_args has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9c98be9edae36ba4bdb057b692b6659b238ee93b9bbb115cb8b5244c6cbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::run::exec_in_sandbox (cyclomatic 18): microsandbox_cli::lib::commands::run::exec_in_sandbox 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":"crates/cli/lib/commands/run.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e05b100f6f3fd6e42201fc4172daa0400e7bca0f572915888fb7e923c6ec944"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::tree::try_show_tree_from (cyclomatic 18): microsandbox_cli::lib::tree::try_show_tree_from 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":"crates/cli/lib/tree.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d68fbcf1827b2b5a03e4b3b1db6096ac22c47e19d3834050538142231d138f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::dir_ops::do_readdirplus_for_each (cyclomatic 18): microsandbox_filesystem::lib::backends::passthroughfs::unix::dir_ops::do_readdirplus_for_each 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":"crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f10bf6e2febf8f9eb740658f3ddef3b9abac69d1a1052efc0f1aa2281b975c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_unlink (cyclomatic 18): microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_unlink 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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd71d3275ef56c70814b2d8bd5c6068715b92af54cbb8f980ad63d4d249b6d23"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointClosure::open_inner (cyclomatic 18): CheckpointClosure::open_inner 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":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25603ac180217646ccc7e3a3961d3474ab796364fd746a6ccf3b7c8217821b"}},{"ruleId":"D1","level":"warning","message":{"text":"Layer::download (cyclomatic 18): Layer::download 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":"crates/image/lib/layer/download.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb0469065162b2c2a368fea8a24e546a177f3171f8dc58ec6a717a505e15e1"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::compaction::compact_stopped_disks (cyclomatic 18): microsandbox_runtime::lib::checkpoint::compaction::compact_stopped_disks 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":"crates/runtime/lib/checkpoint/compaction.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7a0148c5107b85f13806a0991eef324393ce2e9f67b22caf98e89ac2535ca4"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::reject_missing_selection (cyclomatic 18): microsandbox_runtime::lib::checkpoint::migration::source::reject_missing_selection 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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b64d76e7938613095c901d94871dfae2613dd264b15c313b0fe3e721fe892"}},{"ruleId":"D1","level":"warning","message":{"text":"Manifest::validate (cyclomatic 18): Manifest::validate 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":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23648f42acd4bf3f3d0fedd07b2af398af53c1cf21d066b5a72eee32789260f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::helpers::extract_root_disk (cyclomatic 18): microsandbox_py::helpers::extract_root_disk 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":"sdk/python/src/helpers.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f57e9864ce2b97bbacfde31ae8fa002a8c0c6f17b7e1767a3921b613facfc"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContract::validate_network (cyclomatic 18): LaunchContract::validate_network has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82f39b7fbe43ba59bcb420ccf0614b8fde2aff557398242953ae15ad9f1c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::try_append_sparse (cyclomatic 18): microsandbox::lib::backend::local::snapshot::archive::try_append_sparse 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b52e4ff4544ea8d5838bb16bd23d296fa24479ad6ef52917bf6edb9a5720d9"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::setup::storage_alias_catalog::read (cyclomatic 18): microsandbox::lib::setup::storage_alias_catalog::read 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":"sdk/rust/lib/setup/storage_alias_catalog.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f9af467183e0841c924e70bb41c79652835f34d484ccae8e8f77abfdaaa598"}},{"ruleId":"D1","level":"warning","message":{"text":"json-value.parseJson::value (cyclomatic 18): json-value.parseJson::value 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":"packages/control-client/typescript/src/json-value.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcccefd41ad934bc0bf238b924b21fe6bbdee44d018247e604e132ce55b8a2e"}},{"ruleId":"D1","level":"warning","message":{"text":"wire.encodeRecord::normalize (cyclomatic 18): wire.encodeRecord::normalize 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":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7da38d21fcf4d128afd86287ee223fd45ef18f5d31b2c7db52ea9c1c294eb1f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeBuilder::arg_display_width (cyclomatic 17): TreeBuilder::arg_display_width 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":"crates/cli/lib/tree.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d00a9e53ffca8929ebfc180aa71eaf602c31eeb9494a330c59892eb0ef09c"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot (cyclomatic 17): microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot 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":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47296559d79efd805f7066d2fe89512fac031b47b08fe529027ad9232df7ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::create_ops::do_create (cyclomatic 17): microsandbox_filesystem::lib::backends::passthroughfs::unix::create_ops::do_create has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6902bc33a9d1d956328c4ae8745f88636b53ea415852144cbefbd31f064c3e"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointManifest::validate_body (cyclomatic 17): CheckpointManifest::validate_body 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":"crates/image/lib/checkpoint/manifest.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6873d5a17bf3bc7bc3f092ede61f50fb42529dec6e4e41607704d32461f9d44"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestFrameMerger::push_raw (cyclomatic 17): GuestFrameMerger::push_raw 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b25db4a8a9828d5fc3de83ebf67bf3368c03003722224095a96bdfbe3595ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRelay::wait_ready (cyclomatic 17): AgentRelay::wait_ready 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c56185675d45100709565a923228caa23a60f4f49eadb7e2d22a36381c5f67"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::cpu::planner::plan (cyclomatic 17): microsandbox_runtime::lib::runner::cpu::planner::plan 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":"crates/runtime/lib/runner/cpu/planner.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04e093711a82849c0d46b271c00b8f0569f8a86a1883800c483bd39674daf8b"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_vsock::lib::windows::named_pipe_worker (cyclomatic 17): microsandbox_vsock::lib::windows::named_pipe_worker 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":"crates/vsock/lib/windows.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"66446152975be6aa02300cc0a301f8a1bf9b70b6f54d375480e434fa8f972ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_py::sandbox::build_secret_patches (cyclomatic 17): microsandbox_py::sandbox::build_secret_patches 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecf531a56a8ead1b7aec7972272c582a683fbe66a83fe1d4e41d7e884bcc27d"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContract::validate_launch_intent (cyclomatic 17): LaunchContract::validate_launch_intent has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c543fb61ab78aeeeb1831baceb0dc32e614350614c6e9cacf3a09e59386a717"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::read_entry_header (cyclomatic 17): microsandbox::lib::backend::local::snapshot::archive::read_entry_header 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e27ab2496d91f6bde10fe558e07b22b7b4314463623633c01b4735e9df272c6"}},{"ruleId":"D1","level":"warning","message":{"text":"PatchConfig._to_dict (cyclomatic 17): PatchConfig._to_dict 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":"sdk/python/microsandbox/types.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca802527fe1b280571e0bdbc832f43b831b81ec6660ae6974d7a1c288c17a1a6"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::bin::main (cyclomatic 16): microsandbox_agentd::bin::main has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/bin/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1573b8f28100521a0bbb4452ca22c9a4db978917e9f55f8ffe8a01a19f445318"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::fs::handle_bulk_read_stream (cyclomatic 16): microsandbox_agentd::lib::fs::handle_bulk_read_stream has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba13a7912306a0124ecba31c10ad70a7b0316d7f82a0ed11e3bb062d3029197"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::root_disk::validate_superblock (cyclomatic 16): microsandbox_agentd::lib::root_disk::validate_superblock 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":"crates/agentd/lib/root_disk.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"57429773c89efc7ed11c628186cbad3660822917bf2d6f08b18ab07423f2514d"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agentd::lib::session::pipe_reader_task (cyclomatic 16): microsandbox_agentd::lib::session::pipe_reader_task has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: microsandbox_agentd::lib::session::errno_name (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b589ecd9db942c0e83ecd588596f78eb74835516b46621ee935189ee7eef3a"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::exec::drive_stream (cyclomatic 16): microsandbox_cli::lib::commands::exec::drive_stream has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c18b2ba638a9bfb82972e19d45332075171436d1f8a02486e3d8ab936366f1"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::run_doctor (cyclomatic 16): microsandbox_cli::lib::commands::self_cmd::run_doctor has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d1a18a45890c18432bf9854abcd70afaecc080761bf99ab17f14864303153f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::metadata::do_setattr (cyclomatic 16): microsandbox_filesystem::lib::backends::memfs::metadata::do_setattr has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1962d0bea5bca3324085fe1e280bcf094576e6e6ec8a4751783dd504a359af7b"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::owned_unix::read_xattrs (cyclomatic 16): microsandbox_filesystem::lib::backends::passthroughfs::owned_unix::read_xattrs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned_unix.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e98965554a602551fa9b456d0fc39a71f29414d135e0263c239d437255965"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::ext4::jbd2::scan_log (cyclomatic 16): microsandbox_image::lib::ext4::jbd2::scan_log has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/jbd2.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e2ca771fcc6467aa27e5071d8ddf036b6719a1dcd3beec3b14c58ffdfe57f9"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_image::lib::ext4::jbd2::read_journal_superblock (cyclomatic 16): microsandbox_image::lib::ext4::jbd2::read_journal_superblock 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":"crates/image/lib/ext4/jbd2.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6407e2fb3b2e0b1ffe65d97d75a84e9846d65d6825a991cf5a2d320085b06d"}},{"ruleId":"D1","level":"warning","message":{"text":"MetricsSlotWriter::write_sample (cyclomatic 16): MetricsSlotWriter::write_sample 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":"crates/metrics/lib/registry.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"893413d308076c5376d5326ab4729fb4a9358e7b30265c0e0561082de59b2256"}},{"ruleId":"D1","level":"warning","message":{"text":"SmoltcpNetwork::build (cyclomatic 16): SmoltcpNetwork::build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/network.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"783136b344e75c65f9ffd530dd855b612f9559c6e024240ff29cccd4ce3b2c25"}},{"ruleId":"D1","level":"warning","message":{"text":"PortPublisher::relay_data (cyclomatic 16): PortPublisher::relay_data has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa2921ac81c481f4eb8ef4f0f3e7c2b0952112ca94b741de65a8112d20ebe0"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpConnectionTracker::relay_data (cyclomatic 16): TcpConnectionTracker::relay_data has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/connection.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf838d7431dff1384e34176cd9c1305f9854083316db39ac875bacba7658a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolvedOutboundProxy::build (cyclomatic 16): ResolvedOutboundProxy::build has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/proxy/socks.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f99069e63823c1ace69bd3bf1ed90e914b22a709a3cf2e747e71f82b0ee5615"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchConfig::decode (cyclomatic 16): LaunchConfig::decode 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":"crates/runtime/lib/client/launch.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e2b3d56e37a87783c702e2e0efad35d1b8330f1c13e71f2e40e105929bc41"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecControlRegistry::signal (cyclomatic 16): ExecControlRegistry::signal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/exec_control.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"45625ea1381d19b7ada03d28e4075606b6c3c9eb515eab8c45f44e4bf33dc181"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::io::header (cyclomatic 16): microsandbox_runtime::lib::checkpoint::migration::io::header has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/io.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9be213157c63f46958bb0bc7c892228e942a0bbcf32e2e5372034c1e634aed3"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_utils::lib::private_file::windows::verify_policy (cyclomatic 16): microsandbox_utils::lib::private_file::windows::verify_policy has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/lib/private_file.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1389048257594df473974213e30b379cb495d048b18cd3ac799dbc0df34cf519"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_agent_client::lib::optimized::reader_loop (cyclomatic 16): microsandbox_agent_client::lib::optimized::reader_loop has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3b1a93bf4c9340e1df2db27c2b13c08bfcd355ec5bc97ce23fdfc9ad642ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox_types::lib::snapshot::manifest::validate_file_state (cyclomatic 16): microsandbox_types::lib::snapshot::manifest::validate_file_state has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/manifest.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4ce3a9327cef819be10fdf5ec09845d1d81a763c35d6523bd057c47626ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected (cyclomatic 16): microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50ee44ae13edca14f2383050dc67eba2bb2b19e642296a88f4eb7e54d5c812f"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::write_archive_entries (cyclomatic 16): microsandbox::lib::backend::local::snapshot::archive::write_archive_entries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"99139048bc99b8b3f3e98747149212f1f2a8af98ac5a993603b48ebcc0c38277"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::delta::validate (cyclomatic 16): microsandbox::lib::backend::local::snapshot::archive::delta::validate 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":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd93c99be3dc09a5fdce671754fdc9a0fbabc6ad303bc0aa0423622364d2187"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::resolve_with_catalog (cyclomatic 16): microsandbox::lib::runtime::storage_aliases::resolve_with_catalog has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9dfc208879615c804c786b0f733d223760cc79f1add00b2cd5e4c22f03bbe9"}},{"ruleId":"D1","level":"warning","message":{"text":"microsandbox.snapshotStateFromInfo (cyclomatic 16): microsandbox.snapshotStateFromInfo has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/snapshot.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85f2d7b7b0ee5b365ab04b8fb8a34b92c8ec243b1105dc5dbff2a4787fe9c02"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::client_reader_task (cognitive 291): microsandbox_runtime::lib::runner::relay::client_reader_task has cognitive complexity 291 (threshold 15). Drivers by points: if/else 75 (209 pts), match/switch 17 (52 pts), boolean chains 23, loops 4 (7 pts) (nesting depth added 172). 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f609158ad62f69ee920b9eaa9e62c8436e8cc3e8ab00cf1b0a3324cedc8fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::run (cognitive 276): microsandbox_agentd::lib::agent::run has cognitive complexity 276 (threshold 15). Drivers by points: if/else 57 (221 pts), match/switch 8 (23 pts), loops 5 (17 pts), boolean chains 15 (nesting depth added 191). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c670bf97a868153e1f232bc680cf29ed60e69567044ae1c1259195ddd1376"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::handle_message_with_charge (cognitive 194): microsandbox_agentd::lib::agent::handle_message_with_charge has cognitive complexity 194 (threshold 15). Drivers by points: if/else 69 (148 pts), match/switch 12 (28 pts), boolean chains 12, loops 3 (6 pts) (nesting depth added 98). 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafdd878203a9f6110f72d6eefefbb8679ccd28b6d86901fcc2a9c03f76ddd09"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::build_vm (cognitive 142): microsandbox_runtime::lib::runner::vm::build_vm has cognitive complexity 142 (threshold 15). Drivers by points: if/else 61 (101 pts), loops 11 (18 pts), match/switch 7 (13 pts), boolean chains 10 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ede015827ec8b70df1ade864730fcaa6503e47ce6d57d8c081da83a86530334"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::tcp::relay_tcp_session (cognitive 137): microsandbox_agentd::lib::tcp::relay_tcp_session has cognitive complexity 137 (threshold 15). Drivers by points: if/else 27 (101 pts), match/switch 9 (31 pts), boolean chains 4, loops 1 (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/tcp.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff0651293d5e4682b4e46325a1175fd45ebe03d84f783cdc16ee730d7c0e3c5"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpProxy::try_run (cognitive 104): TcpProxy::try_run has cognitive complexity 104 (threshold 15). Drivers by points: if/else 28 (67 pts), match/switch 12 (30 pts), boolean chains 6, loops 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"222211b670f353d6abff920c3d98d1f17b307749b870f31e395ea5c9238128c9"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::discover (cognitive 101): microsandbox::lib::runtime::storage_aliases::discover has cognitive complexity 101 (threshold 15). Drivers by points: if/else 25 (68 pts), loops 10 (18 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf853cc9e32aba802677d31b2391a1265e0b6f8d9023f4dc6c87212932864c92"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::run (cognitive 99): microsandbox_runtime::lib::runner::vm::run has cognitive complexity 99 (threshold 15). Drivers by points: if/else 48 (68 pts), match/switch 18 (23 pts), boolean chains 7, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b299a067f019b480f091a77ef6960de2d26bcfbb6f66bafb655b4b8175a50c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::sandbox_builder_from_args (cognitive 99): microsandbox_py::helpers::sandbox_builder_from_args has cognitive complexity 99 (threshold 15). Drivers by points: if/else 54 (60 pts), match/switch 10 (19 pts), loops 7 (14 pts), boolean chains 6 (nesting depth added 22). 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":"sdk/python/src/helpers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e9b823ab5d8e22f8552accdad266a508febe36e8411e325160f6ee4e963c1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeControlExecutor::execute_locked (cognitive 91): RuntimeControlExecutor::execute_locked has cognitive complexity 91 (threshold 15). Drivers by points: if/else 29 (61 pts), match/switch 11 (20 pts), boolean chains 10 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5f35b42be32edba2d4badad7383f48197806e4c495273062ff82f31109efa5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::recovery_views (cognitive 87): microsandbox_runtime::lib::checkpoint::migration::source::recovery_views has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (70 pts), loops 7 (12 pts), boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6ee473c376af6e6ad81303c325b014d0e5c66510c3abb42fac0b1690721395"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::apply_network_opts (cognitive 81): microsandbox_cli::lib::commands::common::apply_network_opts has cognitive complexity 81 (threshold 15). Drivers by points: if/else 28 (49 pts), loops 11 (25 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c8c4e3d6684932e6b1309a21576468f059681ff8cd2cab95aaa01aa5233b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::bulk_writer_task (cognitive 77): microsandbox_agentd::lib::agent::bulk_writer_task has cognitive complexity 77 (threshold 15). Drivers by points: if/else 11 (40 pts), loops 10 (30 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fe33fc5a5273d3199efbe328d636d4f939b772940d547aa981bfc3f7b00f43"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop (cognitive 77): microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (50 pts), match/switch 4 (13 pts), loops 6 (11 pts), boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d8e779a83c7d75d61cc20a8e71b96e7f3860be6817b2a99ef2898005aac9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchField::parse (cognitive 77): PatchField::parse has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (59 pts), boolean chains 11, loops 3 (7 pts) (nesting depth added 40). 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":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6997b89112ed05bf3ec0b57c9df462c6fc55185383b407d844ffdcebb6885d10"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::parse_mount_spec (cognitive 74): microsandbox_runtime::lib::runner::vm::parse_mount_spec has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (54 pts), match/switch 4 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"677512ddf97143370f9d27d1342fb6f03c6da04b86cf52d1cf8a89078b9244c5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::parse_cli_mount_options (cognitive 73): microsandbox_cli::lib::commands::common::parse_cli_mount_options has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (55 pts), match/switch 5 (17 pts), loops 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0b535ad5000f347a07d326717854367e7d4ed246c9ebf1d896c7c781b3b3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::request (cognitive 73): JobManager::request has cognitive complexity 73 (threshold 15). Drivers by points: if/else 32 (56 pts), match/switch 6 (10 pts), boolean chains 7 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"490434ba23c51c13628d18f45e6c6a58d52efc0b405b5cca81e2a1f20135df52"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::run (cognitive 73): JobManager::run has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (48 pts), match/switch 5 (11 pts), boolean chains 7, loops 5 (7 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4bcbdf676c0edb4cfb6238077f40e08860ff1af4b110ec4429ec851971245a"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRelay::run (cognitive 73): AgentRelay::run has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (40 pts), match/switch 8 (25 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"880f500aec7f3c519ad9c5d208c894f38929954262c2712655c7a29fd0ba4cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::apply_mount (cognitive 72): microsandbox_py::helpers::apply_mount has cognitive complexity 72 (threshold 15). Drivers by points: if/else 50 (66 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 19). 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":"sdk/python/src/helpers.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"520434c8ae9fa73fcf3f5b65a8926dc579e258f43aad4e287ac29c8c7509df42"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db (cognitive 71): microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 7 (24 pts), boolean chains 9 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71d9aa57fa6a7f45d53cde95e2f94c59470f81e4a8dc87beb175822f3b03fb"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::volume_mount (cognitive 69): microsandbox_go::volume_mount has cognitive complexity 69 (threshold 15). Drivers by points: if/else 46 (57 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 15). 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ee4dfcc19509291717aa36d3d8606f59bfb5b5a41da2908edab7e81a03f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MountConfig._to_dict (cognitive 69): MountConfig._to_dict has cognitive complexity 69 (threshold 15). Drivers by points: if/else 28 (57 pts), boolean chains 6, ternaries 6 (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":"sdk/python/microsandbox/types.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0ec2c095dfe1147f82f35ecd9579ab5f16cb7fbbdb469972b72c3449c24dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::msb_sandbox_create (cognitive 68): microsandbox_go::msb_sandbox_create has cognitive complexity 68 (threshold 15). Drivers by points: if/else 42 (45 pts), loops 11 (12 pts), match/switch 5 (6 pts), boolean chains 5 (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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aea103da435d0ed7a035c8db9cf1a07bbeba12cf238e9a2eb569067b99f9441"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr (cognitive 67): microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr has cognitive complexity 67 (threshold 15). Drivers by points: if/else 32 (53 pts), boolean chains 8, match/switch 4 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cbb544d53a1a4a3d292c6a0ba3d144da6950e2b03bad76b6e8e12d0fa52db3"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::batch::load (cognitive 67): microsandbox::lib::backend::local::snapshot::archive::batch::load has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 16 (23 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/batch.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee50bbbc65f3a8c4ed8e0555154f20644d37a5a330cad77c757512dadf5191"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename (cognitive 63): microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (50 pts), boolean chains 11, match/switch 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def581992d99040a225d6f9075b1438e61fca472813714e915c74d9ce41bc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointCoordinator::capture_paused (cognitive 62): CheckpointCoordinator::capture_paused has cognitive complexity 62 (threshold 15). Drivers by points: if/else 29 (42 pts), match/switch 11 (13 pts), loops 4, boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b833a72c0b6c5001c4a773e19b31a45e54339f28db27011359176951461ec7b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBackend::launch_sandbox (cognitive 61): LocalBackend::launch_sandbox has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31 (32 pts), match/switch 18 (22 pts), boolean chains 7 (nesting depth added 5). 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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c35f78191c21fd53986513fe3c20ecaaea929a286e4fea2c33390c13c63baed"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::prepare_docker_archive (cognitive 60): microsandbox_image::lib::archive::docker::prepare_docker_archive has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 8 (13 pts), boolean chains 2 (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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c69e44342689453700a499bacdc3c5536dc4d7a48bff328100b5fbbb12ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::apply_network (cognitive 59): microsandbox_py::helpers::apply_network has cognitive complexity 59 (threshold 15). Drivers by points: if/else 31 (40 pts), loops 5 (9 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9dcdb2952b613c766b37f7d6f8e7de411300790b12a30aa9b8ed294f03126a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::run_fs_bulk_write_worker (cognitive 58): microsandbox_agentd::lib::agent::run_fs_bulk_write_worker has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 5 (15 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2efd7f37c6e24adac9be658272dd27a6aebf87f3b9e754fca6c5a0a1d12fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpRelay::relay_direct_session (cognitive 58): UdpRelay::relay_direct_session has cognitive complexity 58 (threshold 15). Drivers by points: if/else 6 (29 pts), match/switch 5 (17 pts), loops 3 (12 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e7d031bd8490535b0a04ef688198070f90519eee103f30f24f7e2da5503afd"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::bulk_ring_writer_task (cognitive 57): microsandbox_runtime::lib::runner::relay::bulk_ring_writer_task has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 4 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c40c990f0a4d0690b7d875b507df96fb7f84b0637e463ba0cbb30f589034c"}},{"ruleId":"D2","level":"warning","message":{"text":"Network._to_dict (cognitive 57): Network._to_dict has cognitive complexity 57 (threshold 15). Drivers by points: if/else 33 (53 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/microsandbox/types.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236f6855bb09b5d10a69db255a4aa48299016c2d25dc0adc943637ec44da624"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::parse_secret (cognitive 56): microsandbox_cli::lib::commands::common::parse_secret has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44cb1d9b17686f9976b8e27aa4d003357e306dd541ebf75be0ac6bfe1e50e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner (cognitive 56): microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 8, loops 1 (nesting depth added 24). 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":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad27a5158da582c4ecff61fea926c366ab13d1a1ce705ae7217c499d56f1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::ring_reader_task (cognitive 56): microsandbox_runtime::lib::runner::relay::ring_reader_task has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (39 pts), match/switch 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a061e0ea8b2983040cbbfcf5103a6c80b6cc5f48edc9a6ab4148f3bae8408f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_network_patch (cognitive 55): microsandbox_cli::lib::sandbox_config::materialize_network_patch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (39 pts), loops 3 (8 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). 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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"266c1ec9c06f5062e190fb517e9468b76a9f07efec5f4108d79e7c5d74239895"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::ring_writer_task (cognitive 55): microsandbox_runtime::lib::runner::relay::ring_writer_task has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 6, match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"653b2320cfaa9ee4bc761363c74ef44b03b02f72d7e5c29e1f85a60b90d9d0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::layout::reject_advanced_legacy_storage (cognitive 54): microsandbox_runtime::lib::checkpoint::layout::reject_advanced_legacy_storage has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 5 (13 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc437aecc1b8ca82bff253392121d2cbf54b977a6ab5b7f439382d73b12f9b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner (cognitive 53): microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner has cognitive complexity 53 (threshold 15). Drivers by points: if/else 32 (35 pts), loops 12 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"482a1510fb2fb6cb98893001492ef17f567e3e7da8f18d1520df78430de96d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::inspect::run (cognitive 51): microsandbox_cli::lib::commands::inspect::run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 8 (20 pts), loops 3 (9 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/inspect.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad06751ba28dbade35c93da89b503399bd98fb641baf0e5221adc1e3f1dea195"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRelay::wait_ready (cognitive 51): AgentRelay::wait_ready has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 1 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"74466120c2c6cac9b99d1f5827527b44b928b8de1609c6b2f688ee68e0aada5a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::apply_network (cognitive 51): microsandbox_go::apply_network has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29 (36 pts), loops 9 (13 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b539888e5638d74b07775cedaddcd534566ba063a407a6d8556dc7b91fa69d6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_ruby::apply_builder_options (cognitive 50): microsandbox_ruby::apply_builder_options has cognitive complexity 50 (threshold 15). Drivers by points: if/else 39 (45 pts), match/switch 2 (5 pts) (nesting depth added 9). 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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c750414846c653cde6a9b33507390d344c18268257dff9fc2c6be9661dec4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::prepare_oci_archive (cognitive 49): microsandbox_image::lib::archive::docker::prepare_oci_archive has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 9 (14 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95248652540d3fd41985cb2aea85d14a7c6294b5574a825bcff6eec1035887a"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHandler::substitute_ready (cognitive 49): SecretsHandler::substitute_ready has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c74428a54e579b086b4d8a42323d8706a4e9020244d3651ac64fdd2764dd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointCoordinator::capture_to (cognitive 49): CheckpointCoordinator::capture_to has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 9 (14 pts), boolean chains 7, 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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"758071d13cc67a0164fb6ea76efc81209f84ad683a449cfcf1f3f04be8f9e3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::restore_builder_from_args (cognitive 48): microsandbox_py::helpers::restore_builder_from_args has cognitive complexity 48 (threshold 15). Drivers by points: if/else 33 (35 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). 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":"sdk/python/src/helpers.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e75d4808e6d5d51d0c8178d36880ee6bea9e2cbff4fc9c3b165c8b986dc62c6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings (cognitive 48): microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 6 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e7d26eab4b4e1c1c08029bfb6cc22f29162b711b9923c84a732498668b2ade"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::launch_input::legacy_env (cognitive 48): microsandbox::lib::runtime::launch_input::legacy_env has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (34 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_input.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"750e12ef6a7fe469815cbdaab272337a5dd992df20fa5f47012f5c09bfdc6424"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::route_guest_lane_frame (cognitive 47): microsandbox_runtime::lib::runner::relay::route_guest_lane_frame has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9324d33446215c514b910f4fd158774f10902a69c54bb6220bf3201b49874a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBackend::verified_metrics (cognitive 47): LocalBackend::verified_metrics has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 3 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/metrics_lookup.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cab2c62db034974f5d902dd26ac9b2df1c871af72f44cb4575dd86ee02bef1"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory (cognitive 47): microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 4, match/switch 2 (3 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c655fc1211071a6fddc80772892962604af5d2281cf9df22400e5c0606001132"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::select (cognitive 46): microsandbox_runtime::lib::checkpoint::migration::source::select has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 8, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fd6ddf2ac3aab788a9e2b7f4dead1829af188ea0f0c4de149e9d61f2319a81"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::client_writer_task (cognitive 46): microsandbox_runtime::lib::runner::relay::client_writer_task has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 4 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf5cab873cf2aff6f3e292acef8443a7ae9f39b859bfe4a238f370dcacd8954"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::lane_reader_task (cognitive 46): microsandbox_runtime::lib::runner::relay::lane_reader_task has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 4 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c18abcae05ec5765ee161da791a1b4d5738888625d6d25a96e20eb4a8c2e69"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::jobs::dispatch (cognitive 45): microsandbox_go::jobs::dispatch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 5 (9 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/jobs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ebb52fd4fbb06fc80f2940a816742498870d3afc8167f0901cae866a740ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBackend::materialize_archive_for_child (cognitive 45): LocalBackend::materialize_archive_for_child has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a58f36ffa54ff58b57330a34d93d64937e7342ea21f60fbfb68674f54e15a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename (cognitive 44): microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"086874bd2f56a8eef511f59f4f257f3b7b2701a92b293fa2bf36c192d5467542"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRelay::thaw_restored_workload (cognitive 44): AgentRelay::thaw_restored_workload has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56fb99dfa7882bbb0aaf9de62f7baaa1adce7dba0d76bbc76830432aa493fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory (cognitive 44): microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f9b4a19d67822891c9fbd89e48041282b1ef6a335d80294ff5bd7a36511ae"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestFrameMerger::push (cognitive 43): GuestFrameMerger::push has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9285a984d63e280cfb742822b3019f56248e9bdfded4aa77fbfd91f90b5a9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::secrets::handler::process_chunked_body (cognitive 42): microsandbox_network::lib::engine::secrets::handler::process_chunked_body has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (39 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff1948b162963d501181b2ab6f017e2cf45ba22a2fca737104a9514fa615814"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::parse_network_policy (cognitive 42): microsandbox_py::helpers::parse_network_policy has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (15 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af3c8a0612abf84620bf5db83ed1c72284823a07c2aec37554f28b6a478228"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::erofs::writer::write_data_for_tree (cognitive 41): microsandbox_image::lib::erofs::writer::write_data_for_tree has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1555af703208960200270436182e3f64e7d99d7b2544c432933141db05ecbf1"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContract::to_previous_version (cognitive 41): LaunchContract::to_previous_version has cognitive complexity 41 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 7, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a102d92d2fc3bd958e52142509d4b8b524f03e472bac9211e3aa00e62b499"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::config::parse_mount_options (cognitive 40): microsandbox_agentd::lib::config::parse_mount_options has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (34 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/config.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d61bc79c22c87a0e191072f73ab3090fd802cb56f1de8789365879fbf61303"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::session::pipe_reader_task (cognitive 40): microsandbox_agentd::lib::session::pipe_reader_task has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 5 (12 pts), boolean chains 3, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec81f90faf246b11b902f968b986a45f92fcedadb5871ab4d270ae3002c714b"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpConnectionTracker::relay_data (cognitive 40): TcpConnectionTracker::relay_data has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/connection.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2437230a130d9246a60b5b5d84baf2e51b74d9a4d50e3155d9e4cb6b9698e64"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::spawn::machine_cli_args (cognitive 40): microsandbox::lib::runtime::spawn::machine_cli_args has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 6 (13 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cecbcbaa871d925b3a4a35760c0172106208365395187d30a7e9cae48f45d2"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::machine_cmd::run (cognitive 39): microsandbox_cli::lib::machine_cmd::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (22 pts), match/switch 9 (14 pts), boolean chains 3 (nesting depth added 7). 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":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cbd8998d138ae22f3babf1c7a9611999897b4a6a9ddcb08f41a9f9feebb10b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_db::lib::compat::v0_6_5::config::to_current (cognitive 39): microsandbox_db::lib::compat::v0_6_5::config::to_current has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/db/lib/compat/v0_6_5/config.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a6051279e57be761822ec3e059680c4e5d2834bc8049fc91616a2972426c61"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::run::exec_in_sandbox (cognitive 38): microsandbox_cli::lib::commands::run::exec_in_sandbox has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (9 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/run.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc3616917cf7a7605b500d849f657fc83ab9ce35a42c21771eeb16ec0679f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"PortPublisher::relay_data (cognitive 38): PortPublisher::relay_data has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8738696a022f4fdd7c57275879cdbaf1884cda8d76446ae062141fa0400c9935"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::local_memory_budget::limit_cgroups (cognitive 38): microsandbox_runtime::lib::checkpoint::local_memory_budget::limit_cgroups has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/local_memory_budget.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2468d0acae3a1f3c9c02dffe3a466b8cfafec30c19f903337a3b1de1dbc88961"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::account_aliases (cognitive 38): microsandbox_runtime::lib::checkpoint::migration::source::account_aliases has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (5 pts), boolean chains 4 (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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad052b68068d9b6373fca30d599fe6187c08e8f1c32866833c1d214d3c9ff129"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataReader::read_metadata (cognitive 38): MetadataReader::read_metadata has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/inspect.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b2493e9edc9cec0a7ebe3a3d0b132c9b0182771c71abd78981f9729078bf65"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::cloud::sandbox::reject_dropped_cloud_create_fields (cognitive 38): microsandbox::lib::backend::cloud::sandbox::reject_dropped_cloud_create_fields has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28, boolean chains 7, match/switch 2 (3 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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b512eee482730787e4a4e8f918c6c232f9e1b52e788b6fe23e4aecab3cc330"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::jobs::attach (cognitive 37): microsandbox_cli::lib::commands::jobs::attach has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (11 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/jobs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee99a24c60ad40a95d8ea6ea997822d78500c63761341e0ea1726d4baf47ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_vsock::lib::windows::named_pipe_worker (cognitive 37): microsandbox_vsock::lib::windows::named_pipe_worker has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vsock/lib/windows.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fb61e0c8db30138effad81a6fac51f8f5ed46c851bb07f3cb394aff3e1f88c"}},{"ruleId":"D2","level":"warning","message":{"text":"PassthroughFs::do_setattr (cognitive 36): PassthroughFs::do_setattr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d5727e3a636d984e005002bfb554a8d4208ebff0efed69203357428142d700"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_unlink (cognitive 36): microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_unlink has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 2 (3 pts) (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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439e548000fc2b7815f9d7dc5b7149f5c55f7b95ad2c7015ba1f2145a6cb125"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates (cognitive 36): microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06f83beae84fe4b0ca86f27bee40de81d4a2f1d2de885260ff2bbcf88a0cf64"}},{"ruleId":"D2","level":"warning","message":{"text":"json-value.parseJson::value (cognitive 36): json-value.parseJson::value has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (json-value.parseJson::string) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-value.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"80077df31ad0c5518ce567f548b0f4ddfa992ff16d2cb2f3e95b4852511a3201"}},{"ruleId":"D2","level":"warning","message":{"text":"wire.itemEnd (cognitive 36): wire.itemEnd has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 4 (9 pts), error handling 1 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df470e3f5111e0529527a6696e77f0674e6a01dfc207f391e68b922241377d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SandboxOpts::build_network_policy (cognitive 35): SandboxOpts::build_network_policy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 5 (9 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ce6f0b180805205d6033a25a53d0d0e05b657238d98301207b8c7b49370f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::validate_shape (cognitive 35): microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::validate_shape has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 9, loops 4 (6 pts) (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":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02eec5c03f6db6cc65bb58c7e418f82123bb67bbabd22d77715d88f165b319"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::cache_storage::candidates (cognitive 35): microsandbox_runtime::lib::checkpoint::cache_storage::candidates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/cache_storage.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57739c853aff3980fc91c430848b030d7edb18b5a5a864f1bfdba4d37b3de4f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agent_client::lib::optimized::reader_loop (cognitive 35): microsandbox_agent_client::lib::optimized::reader_loop has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 5 (14 pts), boolean chains 2, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4911f9716def427f7b2eeb990bebfea11cb0068174e01a8ef5a444fefaf8c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::downgrade::load_candidate (cognitive 35): microsandbox::lib::backend::local::snapshot::downgrade::load_candidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 6, match/switch 2 (5 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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33e5eec1273d4b9befae7e34c6813245ab212a0d858bda6a39e26b88acd002c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl (cognitive 35): microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (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":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2534b95d8873fb3f0de918d2a2a4808cd4367680b73cc6b480b2dd356c403ed"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::config::validate_guest_bootstrap (cognitive 34): microsandbox_agentd::lib::config::validate_guest_bootstrap has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 6, match/switch 2 (5 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":"crates/agentd/lib/config.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aca3e9968fbf272988e2057e9fe3c98439f5206c32312f84891ed302a3bfc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::tar::ingest::ingest_tar (cognitive 34): microsandbox_image::lib::tar::ingest::ingest_tar has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 5 (13 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44f4436756fe845fbd387b5319cc8618d8a3b936b353e08c47b4ba6b4be3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::write_archive_entries (cognitive 34): microsandbox::lib::backend::local::snapshot::archive::write_archive_entries has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0671cca79283fbb4893e5151c475d14c000235c028578666a64890a69db6d09b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecSession::spawn_pty (cognitive 33): ExecSession::spawn_pty has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80fb50c735562d3c96fad3f372b50d3e48a0647a0978cb330949103f6980cce"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::run::run_new (cognitive 33): microsandbox_cli::lib::commands::run::run_new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (23 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). 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":"crates/cli/lib/commands/run.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d71b14ad941fc4a09582660ade8ad1355a3d83ba3c6792f785d226c9ccfc31"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::jbd2::scan_log (cognitive 33): microsandbox_image::lib::ext4::jbd2::scan_log has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"crates/image/lib/ext4/jbd2.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"01042dc111e36b206dde7e678cde9f46e38514ac7ecba40945958861da1aebb1"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedCleanup::prepare (cognitive 33): PreparedCleanup::prepare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, match/switch 2 (5 pts), loops 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/image/cleanup.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c20d4aacdec193f67261841374996d50237582cd2cd6437e18193be76b6f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_mount_object (cognitive 32): microsandbox_cli::lib::sandbox_config::materialize_mount_object has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5df83a22ff63d24910aaae205dc92b0d483a1a2d9574bb7b3d501952f5a44f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::mobility::validate_shape (cognitive 32): microsandbox_filesystem::lib::backends::passthroughfs::unix::mobility::validate_shape has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 4 (6 pts) (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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b32760701289a5e94d7e53fb9f2fc2098a1f4fb73ff50e31a3055ce0c1bc2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointCoordinator::capture_disk (cognitive 32): CheckpointCoordinator::capture_disk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 5, loops 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0515425670a005c3ef3f3d747b678fc125c8bd6f5d95b3a583d11f84c1eb92ed"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::read_entry_header (cognitive 32): microsandbox::lib::backend::local::snapshot::archive::read_entry_header has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4648722cb0cd0ed941fb3ae415c5e03c54b9035b3adc22bf5039000042999361"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBuilder::format_arg (cognitive 31): TreeBuilder::format_arg has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/tree.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c260a865f42262f0588c2d8631c0606f259c0520079c5b697c2684a6a5360533"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename (cognitive 31): microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 10 (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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c06f09d49862829e1a5b838cf3acabc95e84fa6e19f678153e24b2880982912"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::prepare (cognitive 31): microsandbox_filesystem::lib::backends::passthroughfs::windows::mobility::prepare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7029ddcc02005a92bf09d14ef725c6b2916e26d71908482d52db86676715b17a"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::materialize_layer_stage (cognitive 31): Registry::materialize_layer_stage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/registry/client.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"534eddc4bd124f081864d223910d1cf7c724b05a43fbddb9ba499bff36b39119"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments (cognitive 31): microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 15 (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":"crates/metrics-collector/lib/exporters/otel.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2cc3861987c061cd788401a7f9981a6d8a835dc72a839863cfc7ff26b85984"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::validate (cognitive 31): Manifest::validate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa690422b775794e0f66cc569cbf83a87ad64f83a2e75bb4fe34d5d763ab966"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::fs::handle_bulk_read_stream (cognitive 30): microsandbox_agentd::lib::fs::handle_bulk_read_stream has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75276c2455ffe22dfc5577ffa2ab4f061c6c767333007c7bb934414855de521"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::dir_ops::do_readdirplus_for_each (cognitive 30): microsandbox_filesystem::lib::backends::passthroughfs::unix::dir_ops::do_readdirplus_for_each has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"644dd37de657d6c53cb6917ab7433978c8857a0159937c2364d5eba71e5754c0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resizer::parse_and_validate (cognitive 30): microsandbox_image::lib::ext4::resizer::parse_and_validate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, loops 2, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcbeb065992b9e2bb6875863b82f4e7097727806b5ac8ba392ffee55a9edbf3"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHandler::substitute (cognitive 30): SecretsHandler::substitute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306ce4145e0afdb4199971790128eded5044680a786159d50c32d310adfa929"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::ports::publisher::inbound_relay_task (cognitive 30): microsandbox_network::lib::engine::ports::publisher::inbound_relay_task has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71572843d3fd602696244a17f51ae0d10494b848166d4711229e61edb3c00ed"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::remove_ops::check_merged_dir_empty (cognitive 29): microsandbox_filesystem::lib::backends::dualfs::remove_ops::check_merged_dir_empty has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 18). 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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8cae4fadc8334d4a467602b9c70a2180313149a66887773fcef8bbc0b1a91"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::cpu::planner::plan (cognitive 29): microsandbox_runtime::lib::runner::cpu::planner::plan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/planner.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"133e60222516e9be536486117dab4dee5d60b67e3e17f209d222a86e33e87798"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::delta::validate_resolved (cognitive 29): microsandbox::lib::backend::local::snapshot::archive::delta::validate_resolved has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3d2640b486b76485ec2f3ad4bcefef4630a2ae18d100a8b3bfabe8118b2af7"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBuilder::arg_display_width (cognitive 28): TreeBuilder::arg_display_width has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/tree.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a6333651d95af181d13a8b86f249824371d06051390d6d9b401bc2c254df18"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::exec::drive_stream (cognitive 28): microsandbox_cli::lib::commands::exec::drive_stream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (7 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":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"166efea2164b963e3f3b445080b38b24b2ff9e6f11470dc51c0d3349db869b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::materialize_config_patch (cognitive 28): microsandbox_cli::lib::sandbox_config::materialize_config_patch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (21 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 4). 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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e7e8852e0783d7b09835555082f7f8e389863b91d3fe2d40621d650c7cd75b"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpRelay::relay_socks5_session (cognitive 28): UdpRelay::relay_socks5_session has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (10 pts), loops 2 (6 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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c2f8d94df69e8c8268f311245c13bbe200cf568ce3f919930894dcbb49bf80"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current (cognitive 28): microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 7 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf15cbd538c4f863198a2fe3121ab0cf3397a42782d518190dcde9827bce6b21"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_types::lib::secret_plan::plan::push_secret_changes (cognitive 28): microsandbox_types::lib::secret_plan::plan::push_secret_changes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2, loops 2, match/switch 1 (2 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":"packages/microsandbox-types/rust/lib/secret_plan/plan.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b069d146fa66079003eb26346881f415e4218a5d78149bf839dfc396a26b2c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"RootedVolumeFs::resolve (cognitive 28): RootedVolumeFs::resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/volume/fs_root.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dc21e1744fba0038f5f10b51e28d95244e360776d2618245db6a36ef687661"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected (cognitive 28): microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef13e5a73aaa1fb800843f67f0767bb4edc8577f6fe870eb6d564654e56c7a2"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.buildFFICreateOptions (cognitive 28): microsandbox.buildFFICreateOptions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/sandbox.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5205e401486ad6b42b4f465377224279e878c06b53cad7b554d355d663aca1"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSession.exchange (cognitive 28): JsonSession.exchange has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 3 (7 pts), loops 3, boolean chains 2, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-session.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47a1789b494f8d9282d0a8f4dd31f8eaf6799e4aa62f0e87a2a0427027783cb"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnedDirectorySnapshot::validate (cognitive 27): OwnedDirectorySnapshot::validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 9, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"649bafce7e5af80e6ad66efd63af5a6126818776b30f72aed1515a6937d2eec8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::metadata::do_setattr (cognitive 27): microsandbox_filesystem::lib::backends::memfs::metadata::do_setattr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (27 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd04f774f445f7d57b3b309614204edcc1a2b4401a74d4e0823686e98ec843"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::create_ops::do_create (cognitive 27): microsandbox_filesystem::lib::backends::passthroughfs::unix::create_ops::do_create has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (25 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":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6588ffd9a2a9fc833c74776a11d860ae33483796533553633520a08c41a1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointClosure::open_inner (cognitive 27): CheckpointClosure::open_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17b3bb2e730d94980a0b9d09ff0ab9169c8068e5471b83f81c5839cd4844d5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resizer::grow_storage (cognitive 27): microsandbox_image::lib::ext4::resizer::grow_storage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (5 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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d85805a4bf83fa9d8492607a1924b74003088ac5ec2c04bfa68341519a428c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::compaction::compact_stopped_disks (cognitive 27): microsandbox_runtime::lib::checkpoint::compaction::compact_stopped_disks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (8 pts), loops 5, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/compaction.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac902d9124c5af89b7cd4a397cdf42289926024554f246dfb901376a3d8189d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::restore::builder (cognitive 27): microsandbox_go::restore::builder has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, loops 4, match/switch 2 (4 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":"sdk/go/native/src/restore.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ebecdf7d5ddeccfe34d77f2f797a622d79286a16d403cbc830c0aa75348394"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::open (cognitive 27): Reader::open has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 15). 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":"sdk/rust/lib/logs/stream.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54ae65abd006035af45be448848869aa531b44061dfa80868bec62d448aeacb"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::try_append_sparse (cognitive 27): microsandbox::lib::backend::local::snapshot::archive::try_append_sparse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b0ada6a079c32cb5cd34bef570caa197390a44883f965d1039a03a69114190"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::deletion::recover_parent (cognitive 27): microsandbox::lib::backend::local::snapshot::deletion::recover_parent has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 12). 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":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53049b36f4163d7dbdcb4993a2610c538ce88fe7abac12a899b0cf8910a9853"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::verify::verify_snapshot (cognitive 27): microsandbox::lib::backend::local::snapshot::verify::verify_snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/verify.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"df40b98f95ed27fc465e950292af2a084134ca3efb3b9cac5ca90f97b893aed1"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::dir_ops::do_readdirplus_for_each (cognitive 26): microsandbox_filesystem::lib::backends::dualfs::dir_ops::do_readdirplus_for_each has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa47a76c191861ea78a6a24675194c5d35e0a263f27b72c439215b901137e5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsForwarder::forward_query (cognitive 26): DnsForwarder::forward_query has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dbca97b268c2a4c8e90d87fddda5463560a4c65f0aac80f2ddc091f5943b01"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::delta::inspect_sources (cognitive 26): microsandbox::lib::backend::local::snapshot::archive::delta::inspect_sources has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (9 pts), match/switch 4 (7 pts) (nesting depth added 15). 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":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f634eefa8663ecf228ce7fe695c85ca454d0998f25666e645e43e6221bebc1a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::owned_volumes::validate (cognitive 26): microsandbox::lib::runtime::owned_volumes::validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/owned_volumes.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7e61427cd90c86111f1a9ce1b64b21357613c5cc5a15f422aca1cf8728109b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::mount_checkpoint::resolve_mountpoints (cognitive 25): microsandbox_agentd::lib::mount_checkpoint::resolve_mountpoints has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/mount_checkpoint.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"19598ce486d28aeb9e84ff19a849bd34b0e183e1e95ed1aad998668d069cdd6a"}},{"ruleId":"D2","level":"warning","message":{"text":"SandboxOpts::build_outbound_proxy (cognitive 25): SandboxOpts::build_outbound_proxy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"857df0be9a081f37d61dfef65075f1aedad72ea091ab90117522d3da03b1ff74"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::repair::interactive::prepare (cognitive 25): microsandbox_cli::lib::commands::self_cmd::repair::interactive::prepare has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd/repair/interactive.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddf127a22140389aae066573b6150e6838f434ed28fe9955992574189921054"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::storage::print_prune_report (cognitive 25): microsandbox_cli::lib::commands::storage::print_prune_report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 1 (2 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":"crates/cli/lib/commands/storage.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20381f12657799aef058e88778430cce983acc86b3fdfa84916228b020de62f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resizer::first_extent_physical_block (cognitive 25): microsandbox_image::lib::ext4::resizer::first_extent_physical_block has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36c57ff4256049917d97aca143791c1e2240d4c238701d91a7d5c14ad9c355"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsRegistry::reserve (cognitive 25): MetricsRegistry::reserve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics/lib/registry.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"74182aab28a75a007116a470e8867849e4c2923df7399ff7a8b0d61f5c6c61b0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::reject_missing_selection (cognitive 25): microsandbox_runtime::lib::checkpoint::migration::source::reject_missing_selection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda5254641579054d190db025471e83ad38779f46eb68baa5572421ecad1ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::migration::reconcile_paths (cognitive 25): microsandbox::lib::backend::local::snapshot::migration::reconcile_paths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 7 (9 pts), match/switch 2 (4 pts) (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":"sdk/rust/lib/backend/local/snapshot/migration.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"45adbd2e66220aa27d5bcde8be84ec0b21cc51e4a6cb8f28bfc0df505a967473"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::snapshot_relations (cognitive 25): microsandbox::lib::runtime::storage_aliases::snapshot_relations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc5b70242f62ceda952a1f2fceff18164acc002e023a44398163a7f764e9b28"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::setup::storage::read_catalog (cognitive 25): microsandbox::lib::setup::storage::read_catalog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (21 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"sdk/rust/lib/setup/storage.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b256155251f249ebe4610b1a3e04346b7ab2b08816a7380b48027431082fce1"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::sandbox_config::resolve_image_input (cognitive 24): microsandbox_cli::lib::sandbox_config::resolve_image_input has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 1 (nesting depth added 13). 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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"932042696d8861010951dbf5fceaf8650ccfaca743dd37a8001a59b22b1ddfad"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode (cognitive 24): microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f2db672a045240808cdc74857fe055535ada5fa42e5298956e30d07edd4a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::snapshot::owned::verify_owned_directory_payloads (cognitive 24): microsandbox_image::lib::snapshot::owned::verify_owned_directory_payloads has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/snapshot/owned.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda332e95eae681c44ce4ec3762cdd05c7c3b4a8069373387063e705e3d42417"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tls::proxy::intercept_relay (cognitive 24): microsandbox_network::lib::engine::tls::proxy::intercept_relay has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (9 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21cd5af23668b7c4cb2e231ce8ea2d6bfa952a4a70352214625d5dea73b9d40"}},{"ruleId":"D2","level":"warning","message":{"text":"JobManager::start (cognitive 24): JobManager::start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafed05600634b84a76f11e2263601535c89b86dd729f0555d77ac17e1eae1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::validate_headers (cognitive 24): microsandbox_runtime::lib::checkpoint::migration::source::validate_headers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e87a032a436f8325838ef3b1e1befd54caf121b679d2145d89c0e6795fb3c47"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::cpu::topology::discover (cognitive 24): microsandbox_runtime::lib::runner::cpu::topology::discover has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 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":"crates/runtime/lib/runner/cpu/topology.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"973bd6a2f14c642c4cfeb60ae56dfe66c2d7b67c969708eb252ceee723693a89"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_utils::lib::log_text::strip_ansi (cognitive 24): microsandbox_utils::lib::log_text::strip_ansi has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/lib/log_text.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ab5f205f2c2f363b3abb1171fd6f890ea8b7a059cfe980098dd59e1871c769"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_types::lib::snapshot::owned::validate_owned_volumes (cognitive 24): microsandbox_types::lib::snapshot::owned::validate_owned_volumes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (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":"packages/microsandbox-types/rust/lib/snapshot/owned.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab023871974accecdb89b84e6850b03da3533faa4d94952ff0c87bfe76657e83"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.ffiForkVolumes (cognitive 24): microsandbox.ffiForkVolumes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/sandbox.go"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75492d04e6f63bd1d7ec10b7f6b70cf068039aa68909896fd6ac13ecfa9c473"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::modify::run (cognitive 23): microsandbox_cli::lib::commands::modify::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cee97277da11da9eea4e540922c6e774375a3338098996bd6039feee2bac8aa"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rmdir (cognitive 23): microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rmdir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab134e237be2a07b9dfa9c5bc459cdc6fa4fa9a1133873854f309a364693825f"}},{"ruleId":"D2","level":"warning","message":{"text":"Layer::download (cognitive 23): Layer::download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/layer/download.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd56201a92576b7e2d4dda1960d0d79b5b21808960c3b55a4c5d3311448cceec"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::secrets::handler::detect_blocking_action_in_fragments (cognitive 23): microsandbox_network::lib::engine::secrets::handler::detect_blocking_action_in_fragments has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":3225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc59fe9aa6371ed972a0a928d1a3954549850eb96c2fdb1a462dfb6af0ee7f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher::run_lane (cognitive 23): Dispatcher::run_lane has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts) (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":"crates/runtime/lib/runner/control/dispatch.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbe33503876b3ecd36288a648982cf60f290b691d2d0fcb4dd0f2af4529218"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agent_client::lib::local_shm::receive_local_shm_upgrade (cognitive 23): microsandbox_agent_client::lib::local_shm::receive_local_shm_upgrade has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agent-client/rust/lib/local_shm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"25018d9279739e5407c23f5ec1677c05623a0fb2dfbd0fd104cc9b2a5e8ddc01"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::build_archive_inventory (cognitive 23): microsandbox::lib::backend::local::snapshot::archive::build_archive_inventory has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca866f443917d3f26df64e5bc54590ea3980707880d2ff03409c351eaab5c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::store::list_dir (cognitive 23): microsandbox::lib::backend::local::snapshot::store::list_dir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 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":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb1c42bb2c00e66a084ce8436ab78f19985c7a8614e4a0fa6be91c1ec12e877"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::owned_volumes::try_acquire_disk_guards (cognitive 23): microsandbox::lib::runtime::owned_volumes::try_acquire_disk_guards has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/owned_volumes.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac83cadf4a3304c2a4b7f09b18b66bee1b14065526dce833339ea9e4ce31f75d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::resolve_with_catalog (cognitive 23): microsandbox::lib::runtime::storage_aliases::resolve_with_catalog has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbfbc62cb48cef1e5056c151ccf8624b9ff5ad2ede4b979b67e13bb14d0373c"}},{"ruleId":"D2","level":"warning","message":{"text":"json-value.parseJson::string (cognitive 23): json-value.parseJson::string has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 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. This shape REPEATS in the file: one other method here (json-value.parseJson::value) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-value.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0abc489d6bce360452f7a73954e8e9e1ebd67767858d2f5689a15c9f5cb843a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::run_doctor (cognitive 22): microsandbox_cli::lib::commands::self_cmd::run_doctor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2 (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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71d620ef423080e52914a725f39ca7262744b60ef515e4d72b0142faee498b9"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::tree::try_show_tree_from (cognitive 22): microsandbox_cli::lib::tree::try_show_tree_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/tree.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d10afd4091553b29af4cb6f9eb19c88450127da7a3b25e1522b080f99972c1"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::ports::publisher::write_host_data (cognitive 22): microsandbox_network::lib::engine::ports::publisher::write_host_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (9 pts), 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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3568535729e269881d33a3ed01b36f3aa771327c52b3bfdf1084ac34349bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tcp::connection::write_proxy_data (cognitive 22): microsandbox_network::lib::engine::tcp::connection::write_proxy_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (9 pts), 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":"crates/network/lib/engine/tcp/connection.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d15befbbc6770bc9fb981ff97d887763d5d0ada3733773add9167aed1cf4422"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrationPlan::revalidate (cognitive 22): MigrationPlan::revalidate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 3 (5 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":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"deab4204c7f7b58c2b7dd21e84b1e4a2a78b96a6c8833151220a0bc73cb8ad77"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecControlRegistry::signal (cognitive 22): ExecControlRegistry::signal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/exec_control.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6687499ef2c0d7d2dfacecc091c0b679226edda47483b429d957a6b4a71d0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::selected_sources (cognitive 22): microsandbox_runtime::lib::checkpoint::migration::source::selected_sources has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0b770960a5e59c8e1da5ab7dcba42368b2fc3cab699b54fb42a24ef4d5f7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::object_pipeline::run_pipeline (cognitive 22): microsandbox_runtime::lib::checkpoint::object_pipeline::run_pipeline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (9 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/object_pipeline.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"516074c56bf6fa6c2b306428acbc55f7bb52b5ec75b0572f5750f62746d5dcf6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::sandbox::build_secret_patches (cognitive 22): microsandbox_py::sandbox::build_secret_patches has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (5 pts), loops 2 (3 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8153d7079171427c2e58117a8c176de526b65ab45330d34bc3bc6909d2ec1b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::unpack_archive (cognitive 22): microsandbox::lib::backend::local::snapshot::archive::unpack_archive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1851658ade31dff0e969e3eecdd3da59940db61c2e14856eb4dcc1a5438fd48b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.decodePersistedRootfsSource (cognitive 22): microsandbox.decodePersistedRootfsSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 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":"sdk/go/options.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39523eebd69056687e5c25ca5f5c7b24866cedf853598abdc06fc139bc4324e"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::repair::interactive::run (cognitive 21): microsandbox_cli::lib::commands::self_cmd::repair::interactive::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (5 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":"crates/cli/lib/commands/self_cmd/repair/interactive.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c40dbd7e6bcc9e3b113cf18232c4c9b4cc89246c3dd80344e3fa108d363a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::repair::interactive::process_batch (cognitive 21): microsandbox_cli::lib::commands::self_cmd::repair::interactive::process_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd/repair/interactive.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b6b1e91fde95bd601f44de0d9b1c27203af919c76b43e64c9f861143e1f152"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::storage_doctor::write_diagnosis (cognitive 21): microsandbox_cli::lib::commands::self_cmd::storage_doctor::write_diagnosis has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (5 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd/storage_doctor.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a115fe23fe56541bc3516f847475a41c02b9d9283d7787031812f2fdc6755f"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::owned_unix::read_xattrs (cognitive 21): microsandbox_filesystem::lib::backends::passthroughfs::owned_unix::read_xattrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned_unix.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6613d0dc23922a3cbbb8c304c118114a387f8f8ed5d20dcfc800ccef1ea3892c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::resolve_oci_manifest_candidates (cognitive 21): microsandbox_image::lib::archive::docker::resolve_oci_manifest_candidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts) (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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e06274e1c2da63202e87da60b451db002120039c572ff8888418396e0f32b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::erofs::writer::write_metadata_for_tree (cognitive 21): microsandbox_image::lib::erofs::writer::write_metadata_for_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"059990403a6bc1c555b1341bc43d604cd6e617522147835405701af2d8808ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::formatter::build_directory_data (cognitive 21): microsandbox_image::lib::ext4::formatter::build_directory_data has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts) (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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"108f209c226775419ab86474c6498802fd3fe479c02e363fa9b04bf358ce85ec"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tcp::proxy::classify_first_flight (cognitive 21): microsandbox_network::lib::engine::tcp::proxy::classify_first_flight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c6ec0b3cd064d10fc106460bb0a2699e5fe5316574b7e2c425a9f7d74e175b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::coordinator::admit_resources (cognitive 21): microsandbox_runtime::lib::checkpoint::coordinator::admit_resources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (2 pts), 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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06cce8e6ca7494fce34202ad3439e06d9a5b8053cd450edb60055eb9b3945c7"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::namespace::acquire_parents (cognitive 21): microsandbox_runtime::lib::checkpoint::migration::namespace::acquire_parents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/namespace.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4d40988a29f5141088998afd4e68d6e9a643fc474a38f381b7a5b1560ce32"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::envelope::inspect (cognitive 21): microsandbox_runtime::lib::runner::relay::envelope::inspect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay/envelope.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23322f5fb95ca47018aa00859a48f35da813b1eb7c38be817f2bdea7e403c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_utils::lib::extent::scan_impl (cognitive 21): microsandbox_utils::lib::extent::scan_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 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":"crates/utils/lib/extent.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"be157c1e0a6ed5b9a8be2a69d5a516be9a1327b4a2a42042b28df3ef376cbf33"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_utils::lib::private_file::windows::verify_policy (cognitive 21): microsandbox_utils::lib::private_file::windows::verify_policy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/lib/private_file.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a974c97f43c0272b1077a351b1e86f5c488c1bb6f701efa4b9f0216a4304ed92"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::validate (cognitive 21): Manifest::validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2, boolean chains 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":"packages/microsandbox-types/rust/lib/snapshot/manifest.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f00037f2bee883b701cd8f29ce2a4a50d7424dbc1b97c105f2f3c2fe2dd63dc"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_types::lib::secret_plan::plan::push_secret_conflicts (cognitive 21): microsandbox_types::lib::secret_plan::plan::push_secret_conflicts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3, 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":"packages/microsandbox-types/rust/lib/secret_plan/plan.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba89fa4805716fcd16baba87d88d73a57a34466fd62d6d4eeb3e27c4c5b8483c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::volume_fs::local_dispatch (cognitive 21): microsandbox_go::volume_fs::local_dispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/volume_fs.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f650bbffd5329ef8a5880b7a5e6935e5d68cb828b3eab560dd58546177b551"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlSessions::get (cognitive 21): ControlSessions::get has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/control/registry.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cb6933a745fae5f024318d863d4e86d8ef1b82e7810f30f5343759236d7091"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::host_paths::visit_host_paths (cognitive 21): microsandbox::lib::backend::local::host_paths::visit_host_paths has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (8 pts), loops 4 (7 pts), if/else 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/host_paths.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cd9a3a856e560ae2a9dedab4b0deda597393294abf1989a5024db90667ff01"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::deletion::recovery_parents (cognitive 21): microsandbox::lib::backend::local::snapshot::deletion::recovery_parents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec20781c24eba312726de7ee0a54c2c66544a549f56a9bf52f3360279bad85af"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::group::publish_batch (cognitive 21): microsandbox::lib::backend::local::snapshot::group::publish_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4, 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":"sdk/rust/lib/backend/local/snapshot/group.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca7758c1ac17e153edf545a7189a744b46fe7ffd853fe69604f55effb32ef3b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.validateOwnedMounts (cognitive 21): microsandbox.validateOwnedMounts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/owned_mount.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3a2a29cdce42a06fba9e67bd0e4b70bdb29029588db374f24c6e88c935adb"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.snapshotStateFromInfo (cognitive 21): microsandbox.snapshotStateFromInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/snapshot.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ec9b9800ded394b7c177d7817c5921ce80720deb93cd59f2048a1f64304a38"}},{"ruleId":"D2","level":"warning","message":{"text":"wire.encodeRecord::normalize (cognitive 21): wire.encodeRecord::normalize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bdcb29b2255e69c765cfd91943b0841f32016d0b1c74cb34db9675854b484b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::fs::handle_read_stream (cognitive 20): microsandbox_agentd::lib::fs::handle_read_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb87890ca2e2633af16bf433562758c70e7bf267b13a327f230598c7d278b30"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::session::pty_reader_task (cognitive 20): microsandbox_agentd::lib::session::pty_reader_task has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4aaa74aa641bb8ba01b23046edcece8bf7310dc1523784c5f963edced841af"}},{"ruleId":"D2","level":"warning","message":{"text":"PullProgressDisplay::handle_event (cognitive 20): PullProgressDisplay::handle_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 10). 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":"crates/cli/lib/ui.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"80abb3d1d5bae6bc8ee894c15da04a37870b44e241293830715a1d7ffbf626c8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::self_cmd::execute_prepared_downgrade (cognitive 20): microsandbox_cli::lib::commands::self_cmd::execute_prepared_downgrade has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb2c61c2b64e65fe451c85dfe639251c2c51a78611a27614157568960b8cb8a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::snapshot::create (cognitive 20): microsandbox_cli::lib::commands::snapshot::create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (3 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":"crates/cli/lib/commands/snapshot.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deafa83d3ff60f25c8eb79a8fb603f1675596598fad535a2fda7866be9796eb"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryCapture::walk (cognitive 20): DirectoryCapture::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), boolean chains 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":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"24914590cd52c54cc157d24fb464e2fcf241671c4bbe3e92b54da75aa6d6a4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointManifest::validate_body (cognitive 20): CheckpointManifest::validate_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/manifest.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c3e4e7b80b5e17b7fdfdf11130626b110698b3c9725c95c2ab082c773b6b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHandler::new_inner (cognitive 20): SecretsHandler::new_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"130047cee4d52d5d599b62059b70e6f49d0ef9d0ddb5603bfe35a728fec0b1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPolicy::egress_walk_outcome (cognitive 20): NetworkPolicy::egress_walk_outcome has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/model/policy/types.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb8f5b73de9f61aa039d59901564f76cc7f6eebca98cb1f4b5e7caf44c1c723"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tcp::proxy::handle_connect_tunnel (cognitive 20): microsandbox_network::lib::engine::tcp::proxy::handle_connect_tunnel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c51bf7824b3b4069bf470be44b678ab597db71db65b2cc4f307e81fe00ccb93"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrationPlan::capture_disk (cognitive 20): MigrationPlan::capture_disk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdefdfa9ca7ff31cac7e8f0c8573d8620a361e3e103f812bd065f918124255b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::engine::retained_sources (cognitive 20): microsandbox_runtime::lib::checkpoint::migration::engine::retained_sources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec52176fc8ba1c6b466ef00df06e995f6d4304deccf64dfce4da1bc35dd9ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::alias_sources (cognitive 20): microsandbox_runtime::lib::checkpoint::migration::source::alias_sources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (2 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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dc1aab0b047479af8f235d44b75f0819df78a750010e34bfce82b94095b672"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agent_client::lib::optimized::stream_writer_loop (cognitive 20): microsandbox_agent_client::lib::optimized::stream_writer_loop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fb4ed9d21c78d4803ba2281b83e26436c9b9ec743e4e2f67c9da9435934157"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContract::validate_network (cognitive 20): LaunchContract::validate_network has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a12d845e3b26c50a8c338fc77d697a58952d81d0af739fa371e811047c0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::host_paths::check_bind_roots_do_not_follow_symlinks (cognitive 20): microsandbox::lib::backend::local::host_paths::check_bind_roots_do_not_follow_symlinks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/host_paths.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c983e8cc86133ce1ad8db9d693788611d19a5c227986dcc8baac44242a41fc"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::owned::members (cognitive 20): microsandbox::lib::backend::local::snapshot::archive::owned::members has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/owned.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfc53a700fc0d382d10ae3be170b972f98a6c99472b314bf440f5a31d8b8ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::create::copy_owned_payloads (cognitive 20): microsandbox::lib::backend::local::snapshot::create::copy_owned_payloads has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (7 pts), match/switch 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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6710efd1158844e2d6f5a88a8602cd820ccf950da9799143f84c3ae4000e30c5"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::restore::adopt_local_branch_for_child (cognitive 20): microsandbox::lib::backend::local::snapshot::restore::adopt_local_branch_for_child has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/restore.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf434c92470251586b7f63c4f6d3c3b570efca3abbd02926d1f3e6e0dc0b0133"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::root_disk::validate_superblock (cognitive 19): microsandbox_agentd::lib::root_disk::validate_superblock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/root_disk.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6604f5d19d2affe529e9aba3360a9ea482d87ca388f67699c47410a59116ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"Failure::from_message (cognitive 19): Failure::from_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. 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":"crates/cli/lib/commands/self_cmd/repair/report.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ace78311ae6c154b2191df6759a05f45892649d8ea169164291a4a0fda8262"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::modify::replayed_args (cognitive 19): microsandbox_cli::lib::commands::modify::replayed_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, loops 8, match/switch 1 (2 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":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d233a3e03f6004f54be168cda5e3a349d3bfcdb74b910b1cd62b380451a7494"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot (cognitive 19): microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd7bcc5fa33ef775124d4cccce845acd74f9d8fe23c6e4782dd7fb2671d837"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::prepare (cognitive 19): microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f55b643b75b7d21941b7d5ffa765e7ceb98f6249c4078f14d9952b80e4873b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::validate (cognitive 19): microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7efffb805b8b2f800f1ab1651218ef95aa6b01fcbbdbe1c9460f1a701a8e37"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::resolve_platform_manifest (cognitive 19): Registry::resolve_platform_manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 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":"crates/image/lib/registry/client.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"318e6296a60c87d90b91416dfb3f26d2a214f6675f86991ce01c48ac74feeeec"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyXattrFilter::poll_read (cognitive 19): EmptyXattrFilter::poll_read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/tar/pax.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3fec5a448f941e621a3b7b3cfd53a7a492f064725c4825843d40e7a6fc7acd"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsCollector::run (cognitive 19): MetricsCollector::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 pts), loops 3 (nesting depth added 10). 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":"crates/metrics-collector/lib/core/driver.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e854d86dfefc148be4e72834896b032e646841dffad769d8a81a87cafa1a0d86"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHandler::substitute_http2_headers (cognitive 19): SecretsHandler::substitute_http2_headers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b95164d9c875e6ead1eb9659127fc6ef149c12af11bbe827d6b6af67d1183a"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tls::proxy::serve_tls_deny (cognitive 19): microsandbox_network::lib::engine::tls::proxy::serve_tls_deny has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170e3e557c066ec9cb97c82d26939746bd1e92f28876465bfa7d340df20af9b"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeOwnedAdditionalDisk::open_all (cognitive 19): RuntimeOwnedAdditionalDisk::open_all has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/additional_disk.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3348c11cc493530f9b141d4cacc95e9d9d0a9e3831d963802bef24dff9b34ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryCache::materialize_with_baseline_inner (cognitive 19): MemoryCache::materialize_with_baseline_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/memory_cache.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f007cecb266eb59f9b76f3276394da2ed84df9aed342a2c33bf5a2274837b0db"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::combined_ring_reader_task (cognitive 19): microsandbox_runtime::lib::runner::relay::combined_ring_reader_task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), match/switch 1 (4 pts) (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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d24649b427b81a6f0a0a227e3a4aee36ab42600876fe0b5651cef0bc18e245"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonControlClient::exchange_bytes (cognitive 19): JsonControlClient::exchange_bytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/rust/lib/json_client.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0ca37ca8a93bd0556d2a82e7c7d3f4a4f75650283f6070769fac2aa3b72f76"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContract::validate_launch_intent (cognitive 19): LaunchContract::validate_launch_intent has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"373838cce848e1dda315cd77f3c4ed56edaf51460ff6930f8c9e3f1e666acd8d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::delta::validate (cognitive 19): microsandbox::lib::backend::local::snapshot::archive::delta::validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f708d399579207a847adcf4be9f8abfa6cc7cb631b04663bc5ca8c2556c4c23"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::create::create_snapshot_archive (cognitive 19): microsandbox::lib::backend::local::snapshot::create::create_snapshot_archive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 1 (2 pts) (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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa356503d82e1153e9ac08edba85ec463e1c9a37fb9d0b1b9c4343898a64d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot.state (cognitive 19): Snapshot.state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/snapshot.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd17980a7d4e210bd53d1709e5dd7d114e4ac2e6b1f009a0d6a228b4447c6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::fs::handle_fs_data (cognitive 18): microsandbox_agentd::lib::fs::handle_fs_data has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c2156bbd4df47a43fee125a4679415943e44c7df04051c79da2cfdb2619ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreResourceArgs::apply_restore (cognitive 18): RestoreResourceArgs::apply_restore has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 5 (6 pts), if/else 5 (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 shape REPEATS in the file: 2 other methods here (RestoreResourceArgs::apply_branch, RestoreResourceArgs::apply_branch_many) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/restore.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f1b9e6d04d049195a592cd76f6a3b5efd5df8b282c7d95c5b30c0aa1f63fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreResourceArgs::apply_branch (cognitive 18): RestoreResourceArgs::apply_branch has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 5 (6 pts), if/else 5 (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 shape REPEATS in the file: 2 other methods here (RestoreResourceArgs::apply_restore, RestoreResourceArgs::apply_branch_many) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/restore.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"25572b6a8e14ef32f397c8c171428b9b18ccc0bed4441165f13a2c057185ed17"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreResourceArgs::apply_branch_many (cognitive 18): RestoreResourceArgs::apply_branch_many has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 5 (6 pts), if/else 5 (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 shape REPEATS in the file: 2 other methods here (RestoreResourceArgs::apply_restore, RestoreResourceArgs::apply_branch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/restore.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd49d3accc8566e84a300c2d1bf2d91e59d190c0645f8065644b40386735da6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::context::run (cognitive 18): microsandbox_cli::lib::commands::context::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/context.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8a7692b31eb884e42a59e23da8a1dcfe58aa0d0ee5bbc50880f71bc25fd46e"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::exec::run_started (cognitive 18): microsandbox_cli::lib::commands::exec::run_started has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f1eab11b6eaaa8d123b4a2fe27c4945df7999c75e6006b1cc603c24cef770b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::image::run_prune (cognitive 18): microsandbox_cli::lib::commands::image::run_prune has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f24500ab1b632c30920ebbd306525adcd2a6c9f4b42f573440f93219f55e19e"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::dualfs::lookup::forget_one (cognitive 18): microsandbox_filesystem::lib::backends::dualfs::lookup::forget_one has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90a3f9e4aa0daccfc05f260a0cb7674f855b21e4e824554afe5c675d9e4b34"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::special::do_fallocate (cognitive 18): microsandbox_filesystem::lib::backends::memfs::special::do_fallocate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/filesystem/lib/backends/memfs/special.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7fc026418bcdaf5fc043eb27eb1b0d4420cc5eaeae0b10a6c115afdc709b92"}},{"ruleId":"D2","level":"warning","message":{"text":"StorageLease::shared_async_keyed (cognitive 18): StorageLease::shared_async_keyed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 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":"crates/image/lib/storage_lease.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a771f93890bbe71840cff0718dd5f69f15626c17211ee5b9ab6b7ff2a716be2c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::erofs::fsmeta::write_fsmeta_dir_data_inner (cognitive 18): microsandbox_image::lib::erofs::fsmeta::write_fsmeta_dir_data_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, match/switch 1 (2 pts), 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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbb29c2a80f15b423bc256a5ffb48074fbeed9b4d21d45333b00cd6d9018523"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tls::proxy::bypass_relay (cognitive 18): microsandbox_network::lib::engine::tls::proxy::bypass_relay has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (8 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7806331e259b2b64c039f7f6c374dd6ff3e002ad9b545cd0d13c6098c7bbe987"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlContext::handle (cognitive 18): ControlContext::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/control/handler.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"842b95ad97ababba9a78a625b82fb725a8983c17d1c20b00ec08c9a1b7021d36"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestFrameMerger::push_raw (cognitive 18): GuestFrameMerger::push_raw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"611950ee346d3139d9565357bf3bc86c48743f6eeac65e1e2274093c344922d8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::compaction::compact_live (cognitive 18): microsandbox_runtime::lib::checkpoint::compaction::compact_live has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/compaction.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c6d1321805bca8777f7b72e8c0cff0bb2bdc398a196d604fb99b39ddac58f0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::io::entry_identity (cognitive 18): microsandbox_runtime::lib::checkpoint::migration::io::entry_identity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/io.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e28995ec8fc586224a1df9c3b43f21cd92cbd82b07c1fcabdf48f26fd41c05"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::apply_secret (cognitive 18): microsandbox_py::helpers::apply_secret has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 2, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e03b92b132b76e33276f7c7d0baf7b9d55c0ba6cea2d12735af542a3deb225b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::restore::additional_disks::materialize_additional_disks (cognitive 18): microsandbox::lib::backend::local::snapshot::restore::additional_disks::materialize_additional_disks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (2 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":"sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a387f33d61b829bf70968fa0895145e2c243a0f1a3df44c5402de6f7bd9f4f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::storage_aliases::snapshot_payloads (cognitive 18): microsandbox::lib::runtime::storage_aliases::snapshot_payloads has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed8fbf940b8995bd5a5df6e3059f8945015a729215a03d3afdb1409643facb"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::setup::storage_alias_catalog::read (cognitive 18): microsandbox::lib::setup::storage_alias_catalog::read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/setup/storage_alias_catalog.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bb04faba065f7e5ebd630504f70ebb022c3156ee755881696db8b3c4cf9a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchConfig._to_dict (cognitive 18): PatchConfig._to_dict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/microsandbox/types.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"659c5ad8174facb948d24e8d75c480afdf3c2698f05930d4b1299bd2673450d6"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketTransport.read (cognitive 18): WebSocketTransport.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/websocket.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1643f0da72b15035e1b8a151d6960c469ab3fa4fd78d46a62eb379b4350ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::bin::main (cognitive 17): microsandbox_cli::bin::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/bin/main.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e271981a2f825f418b216b1e647a9b60b2cc97b6df5324e3a9d3578153b4486d"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::branch::run (cognitive 17): microsandbox_cli::lib::commands::branch::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 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":"crates/cli/lib/commands/branch.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaed86666ca7aa6dd77bc86f2384f01ad1c664ca53a07390fa305dc83bc7d58"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::metrics::render_table (cognitive 17): microsandbox_cli::lib::commands::metrics::render_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/metrics.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3206048ab76b717736143da77c820e1395fe1da3dbde11805e5710eafea0951"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::dir_ops::do_readdirplus_for_each (cognitive 17): microsandbox_filesystem::lib::backends::memfs::dir_ops::do_readdirplus_for_each has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 2 (4 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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81eef296b7cd2f8c0f2e901de63cad0f560212cd5c153f8510de67b4857878e"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::memfs::metadata::do_access (cognitive 17): microsandbox_filesystem::lib::backends::memfs::metadata::do_access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a2ac0cb13803745b8bbe795623be1349345d9b3099e8ad314139c9ef667490"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTree::insert (cognitive 17): FileTree::insert has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). 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":"crates/image/lib/tree/model.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70f033efbfe372ead48a00971ae6cf8e497f0657d1be1319eff6711d96b9bad"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::archive::docker::save_oci_archive_inner (cognitive 17): microsandbox_image::lib::archive::docker::save_oci_archive_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (6 pts), match/switch 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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c3ecc05f5eaa00dc1da17657de281a3ed9a7c8e0950840a593deb43cc0841"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::checkpoint::qcow::relocated_qcow2_header (cognitive 17): microsandbox_image::lib::checkpoint::qcow::relocated_qcow2_header has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/image/lib/checkpoint/qcow.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79fee0957902b7acd1470dbfd1c5737f19afa3fa40f2a1f195453cb5dd88b19"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::resize_inode::validate_resize_inode (cognitive 17): microsandbox_image::lib::ext4::resize_inode::validate_resize_inode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/resize_inode.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca825253fffd10cc6b6a1ac2987f6539b81e4469ec32b4f29e35a088697fc00"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::flat::read_erofs_layer (cognitive 17): microsandbox_image::lib::flat::read_erofs_layer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/flat.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"353a8b865bfca1714f43e7e45b2b6bc8c9bd0dddb1300a4929e6752243c5ff90"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::snapshot::owned::validate_owned_resources (cognitive 17): microsandbox_image::lib::snapshot::owned::validate_owned_resources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/snapshot/owned.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a845d92c40859052feb90910426615b06766f34c6a136addc469839341b2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsForwarder::forward_to_configured (cognitive 17): DnsForwarder::forward_to_configured has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 10). 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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee68da6c5eb4a9599a5bc28768d5a3db24c149f6ae832f478837ea077e6b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::dns::forwarder::extract_addrs_and_ttl (cognitive 17): microsandbox_network::lib::engine::dns::forwarder::extract_addrs_and_ttl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), match/switch 1 (2 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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ac0e74869469dd2758a5eeb881a67fea1b1f7a2613e20baf81ec1f5d905b48"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tcp::proxy::relay_connected_stream (cognitive 17): microsandbox_network::lib::engine::tcp::proxy::relay_connected_stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a53ea50bedcaad780afd80dd39e30055ac716c5dfd2cc7f38cab870950dcb6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::migration::source::reacquire (cognitive 17): microsandbox_runtime::lib::checkpoint::migration::source::reacquire has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"896977939b0a683e716e9ef7ef78b06aed8b77808372814df7a32bac3c1b9973"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::cpu::topology::discover_linux_numa (cognitive 17): microsandbox_runtime::lib::runner::cpu::topology::discover_linux_numa has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/topology.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10adaed0234cd7deafcd6e2fcb9b3439b3e745d54aae9046f07be9cbe7764c3"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::relay::push_bulk_fragment_with_stall (cognitive 17): microsandbox_runtime::lib::runner::relay::push_bulk_fragment_with_stall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"94215d56623d435b2314b6dc9aeced3d05b2e62db36d72215b2502f2d6189aac"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::vm::writeback_limited_disk_paths (cognitive 17): microsandbox_runtime::lib::runner::vm::writeback_limited_disk_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f67693a6cc7f7e241f831c8a11aa759e1432150fb279e1ddb5dad814143e664"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_go::apply_root_disk (cognitive 17): microsandbox_go::apply_root_disk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dcc095dfe4c0a6bced4c6722caa4143f247d52258bbd81e8c29c18d5aa27d9"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_py::helpers::extract_root_disk (cognitive 17): microsandbox_py::helpers::extract_root_disk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"25704b12da63767460cb7f3293ac4d4e813067cdbcaa35da2a58bd83670019a0"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::runtime::protected_state::prepare_storage (cognitive 17): microsandbox::lib::runtime::protected_state::prepare_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/runtime/protected_state.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a191ba98d9eee2ae0976a23a714baf9b6c806cefda20edf7ae815b05aa02e3"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTransport.read (cognitive 17): NodeTransport.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/node.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24baecb77e8678cf5fdd90cb7b77967424777ebff564f14993fb549c83532ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessManagerState::reap_exited_batch (cognitive 16): ProcessManagerState::reap_exited_batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/process.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8aafcb325aff2daefca7252e4bdde19549c3e964403bd57a3713f958380dee8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecSession::enqueue_stdin (cognitive 16): ExecSession::enqueue_stdin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54ea141abcb736617d3eaee6da32455de84d484b306c4465530dd419bb1a8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::agent::handle_bulk_record (cognitive 16): microsandbox_agentd::lib::agent::handle_bulk_record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"8497bcc2329ed3831f0ad68b3b934ac43a61706a1e850f0bf6cc32a3c1e94153"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_agentd::lib::storage_preview::write_reply (cognitive 16): microsandbox_agentd::lib::storage_preview::write_reply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 7). 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":"crates/agentd/lib/storage_preview.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111eb25964a6bebebbfefd02e377a80e95875cb5e55998ccfd22b56b715bb06"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::frame (cognitive 16): Picker::frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd/repair/terminal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b215ebcb5f54f4680060769d52f0193e4dda9433d83c93dc30fb9523843ccb6b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::resolve_and_start (cognitive 16): microsandbox_cli::lib::commands::resolve_and_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f65b5d38f1febcf5727f9e3bd2e308b9b1268e41bbae4429844c3a29ec86fda"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_cli::lib::commands::image::run_pull_inner (cognitive 16): microsandbox_cli::lib::commands::image::run_pull_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8f6a51e70ae55d1b8e63de4b5f18c82ecf9f8794aa41ef1d6944c91ce959e8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_filesystem::lib::backends::passthroughfs::owned_windows::copy_detached (cognitive 16): microsandbox_filesystem::lib::backends::passthroughfs::owned_windows::copy_detached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned_windows.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b9de34857dc518c9d891e3e5671d97e54b6200cdc55a7277cdfd1556aa202"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_image::lib::ext4::jbd2::recover_journal (cognitive 16): microsandbox_image::lib::ext4::jbd2::recover_journal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 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":"crates/image/lib/ext4/jbd2.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb423216b7ee7b5168f9d18ebc17dad6738f92666c09cea5cd50763b7e55ff5f"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPolicy::deferred_tail_can_allow (cognitive 16): NetworkPolicy::deferred_tail_can_allow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/model/policy/types.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de687b23cbe9760ff1ed54615efe46b18ed595337ab87366493e552017e98d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedOutboundProxy::build (cognitive 16): ResolvedOutboundProxy::build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (5 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":"crates/network/lib/proxy/socks.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cafda2d414ba512e91ba3f7e9dd5ef4ede7f4fc8c222f9061c75d72ff2c31c6"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::tls::proxy::forward_plaintext (cognitive 16): microsandbox_network::lib::engine::tls::proxy::forward_plaintext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b17a6c6b6bc9296e13e336ed2406592141cfc0bf68128cdea5408990e00848"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_network::lib::engine::udp::relay::parse_pmtu_from_control_messages (cognitive 16): microsandbox_network::lib::engine::udp::relay::parse_pmtu_from_control_messages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e18c36c1b8c2b182caac568b9eeb3352cf41b4f4a10920391277c76c2bba451"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryObjectSink::with_writer (cognitive 16): MemoryObjectSink::with_writer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/capture_pipeline.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce75c6ac4ac865d78901fdea9bc48f0e6638d1fb52d8c7ddbeba9205017aeb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchConfig::decode (cognitive 16): LaunchConfig::decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/launch.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea172c26308d612ad70905808a5dbfaa4ac9ddbd6ebfc8c9465e056704a80218"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::checkpoint::layout::retained_legacy_root (cognitive 16): microsandbox_runtime::lib::checkpoint::layout::retained_legacy_root has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc2c5da8b35ba4e3a35d177916aa37364e6271865017e5e60090e93bd3b2a25"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::client::memory_handoff::receive_first (cognitive 16): microsandbox_runtime::lib::client::memory_handoff::receive_first has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/memory_handoff.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5226cc1fbb19805b40a1e308d8dca849f41fa3c009a0fc0c65e399fb73b048b"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox_runtime::lib::runner::writeback::admission::sync_backing_device (cognitive 16): microsandbox_runtime::lib::runner::writeback::admission::sync_backing_device has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/writeback/admission.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9193e3989fe9115f43eca4d847f499507b2a73bd79c80231ac656ab82b9599b8"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::archive::unpack_sparse_entry (cognitive 16): microsandbox::lib::backend::local::snapshot::archive::unpack_sparse_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d920ac8b245d177f584256a6e70e37e61d26b41e91c87a9f8c98f3f70829d2"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::group::read_members (cognitive 16): microsandbox::lib::backend::local::snapshot::group::read_members has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/group.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ab27ba6ee26b3ea77ea67aad29c92a53c04fe0a29823f4f55580af032f62ae"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox::lib::backend::local::snapshot::group::resolve_selected (cognitive 16): microsandbox::lib::backend::local::snapshot::group::resolve_selected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/group.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"928e04a4e6084384cf3bd3447d754125efcbb74cb3f3e8217eac71f18901935c"}},{"ruleId":"D2","level":"warning","message":{"text":"microsandbox.buildFFINetwork (cognitive 16): microsandbox.buildFFINetwork has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/sandbox.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"751f1a4a1dc616308eb7ecf16379b26cec19c8e2cfffb9de3cb2badc198f7e37"}},{"ruleId":"D2","level":"warning","message":{"text":"Core.readLoop (cognitive 16): Core.readLoop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/core.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38bcd9001fad10eba8bff42cd7a7ec4c6adc8afd0e7767883bef79dc5e205a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 5526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 286 free functions. The bar is 500 significant lines; this is 5026 over it, 11.05\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fb567b95026baf02ed6c5579f47a09f57e4871d83775971b67e8d4ec757c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/relay.rs: FileTooLong \u2014 3757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 3257 over it, 7.51\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"583c6902a3fc1a027afe53e9f2f0210a5894f768cf77cad7dcf340a7e672b0b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::vm::build_vm: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::vm::build_vm runs 697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 597 over it, 6.97\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"566859ccd29cac36e3a17f9bd653af3ab48e4aef421fe183aeb2e4eb77fdb68e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::vm::run: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::vm::run runs 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 542 over it, 6.42\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60de3358092c9009e2c210396b80041183ae3f4e56e844a65bbd5a9935ceb04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/archive.rs: FileTooLong \u2014 3175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 85 free functions. The bar is 500 significant lines; this is 2675 over it, 6.35\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c452b2f07ae586790b8129fb4cc51138acff7921a1447877542c73d3905daf60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/agent.rs: FileTooLong \u2014 2932 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 93 free functions. The bar is 500 significant lines; this is 2432 over it, 5.86\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce955cc0d5facc6a1fccdc42d3d3730f01b0b69d9291ed4ca5e4c9cd50c89d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::agent::handle_message_with_charge: FunctionTooLong \u2014 microsandbox_agentd::lib::agent::handle_message_with_charge runs 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 437 over it, 5.37\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34a9d12fa24e51ee017ed75fa585e3dd96dab1d7eaee94ef54c1bb4d9a9d4a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::relay::client_reader_task: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::relay::client_reader_task runs 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 423 over it, 5.23\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be64b1031d7f902c3dbeaf193a02058be89143cdcdbb17a889e02f60f4e732a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::agent::run: FunctionTooLong \u2014 microsandbox_agentd::lib::agent::run runs 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 414 over it, 5.14\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32950afb4b0be6a444ae68bb9334112710ed9a990eb4026b17b2f2180fcda77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/vm.rs: FileTooLong \u2014 2477 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 1977 over it, 4.95\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da2a30bcb48079c72021b121eee56f66e651920b94e5d87c342b880d19027a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/self_cmd.rs: FileTooLong \u2014 2425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 113 free functions. The bar is 500 significant lines; this is 1925 over it, 4.85\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b57f7dabc64fced953734e15c5bbeb409e47603a1e7300a7be3aacdfca6fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/common.rs: FileTooLong \u2014 2310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 80 free functions. The bar is 500 significant lines; this is 1810 over it, 4.62\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad12e05e11a727eab841801d1664be3d0a68cf1cd9e509123203c2ace87d245a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: secrets/handler.rs: FileTooLong \u2014 2255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1755 over it, 4.51\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da262d6aff4ae60194bb065b0cbd2cde3f74fc32725e1bf83f6dd5735d13e98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 92 free functions. The bar is 500 significant lines; this is 1620 over it, 4.24\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722ce815b39489199f6c380077393b8d68a672ba65ce13c475906a8d24b9783"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalBackend.launch_sandbox: MethodTooLong \u2014 launch_sandbox runs 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1386dff6ec23c7110108af1616aa4aae59a3032a6f0278c1f5a5d54c27116591"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointCoordinator.capture_paused: MethodTooLong \u2014 capture_paused runs 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 318 over it, 4.18\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf13db639a8c5cd9cbf9b80ee0acb02093c9d657f4322648330fdff8b378722e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalBackend: TooManyMethods \u2014 119 methods, declared across 15 files: sandbox/create.rs (31), sandbox/mod.rs (31), local/mod.rs (18), local/volume.rs (8), \u002B11 more file(s). The bar is 30 methods; this is 89 over it, 3.97\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":"sdk/rust/lib/backend/local/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a59267e06cef8ed3081466cc995f4de484f355b6e3cc5436e571db98fe7056d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/coordinator.rs: FileTooLong \u2014 1916 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: CheckpointCoordinator (2 blocks, 55-1941). The bar is 500 significant lines; this is 1416 over it, 3.83\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae1293eca74421d47d56a170f436d3a2b61ead4ce379e10270ea3d9eb4e2f23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sandbox.rs: FileTooLong \u2014 1911 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 1411 over it, 3.82\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f00b0d6cee528af66deaf646c93859cce51e57fbbd5b86e277f541f951e0f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/spawn.rs: FileTooLong \u2014 1906 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 1406 over it, 3.81\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f4027a040f7bf3599d2a05d9326a97ab2c854ac10f617725f34aaa2d27a351"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/domain.rs: FileTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1346 over it, 3.69\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":"packages/microsandbox-types/rust/lib/domain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5944fb952aca8dbb93075a049aedb620a867d817c49daee8ebe87fcb464fed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::runtime::spawn::machine_cli_args: FunctionTooLong \u2014 microsandbox::lib::runtime::spawn::machine_cli_args runs 353 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 253 over it, 3.53\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1b6796e01510efc96df4ee26a6c30f9a3bd77099f6330cf5e4ce482c29a15b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CheckpointCoordinator: ClassTooLong \u2014 1395 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 55-1941. The bar is 400 significant lines; this is 995 over it, 3.49\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"513a22271b13956d0889ef695acda99ae68fd7368bce3dbba42ef4131a0378e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/helpers.rs: FileTooLong \u2014 1629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 1129 over it, 3.26\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":"sdk/python/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c531b87b0290825ad8620c7864fec6bddd566f07f9e2cb1b14b49566d9e21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ext4/formatter.rs: FileTooLong \u2014 1626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 1126 over it, 3.25\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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cbd1ec3ac2348b81e21585ac95098b282ba5a3910fed4c9fb125c9b7f688fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop: FunctionTooLong \u2014 microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop runs 322 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 222 over it, 3.22\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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622daeecf0fc2f91041caf0dc3ddb2a131e782928a14fcd6e953c46036bd9c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/create.rs: FileTooLong \u2014 1609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 1109 over it, 3.22\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26376ee0484a067b3a45e99f8ad506068dae01ba944d54d90fd716629525aa8d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SandboxOpts: TooManyFields \u2014 93 stored fields beside 7 methods. The bar is 30 stored fields; this is 63 over it, 3.10\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df95e5d2069ed83614692e7bd739d340468423bddedf8956c28fcda268fa50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Registry.materialize_layer_stage: MethodTooLong \u2014 materialize_layer_stage runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\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":"crates/image/lib/registry/client.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"6470a79c3467c82a0ffa7e7673ef6f57d37dbbef27716f30a4f9556f91563291"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentRelay.run: MethodTooLong \u2014 run runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.89\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6b940e561fef64f51384cda570715d4ceacbfcc25b58864a4907b76f16a7da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::tcp::relay_tcp_session: FunctionTooLong \u2014 microsandbox_agentd::lib::tcp::relay_tcp_session runs 287 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 187 over it, 2.87\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":"crates/agentd/lib/tcp.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"490ae5aae0ad3fce6422fdbea7d836b0be2e6f7057846bc109beff860def4293"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointCoordinator.capture_to: MethodTooLong \u2014 capture_to runs 283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"78493ec929f6a90bec03a8913d7cf40ab70788b0f7fd4d35b993506dd0b3aebe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: archive/docker.rs: FileTooLong \u2014 1379 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 879 over it, 2.76\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fff5b11756edc5d24fc0694e1cb5283dbd72c05c162f9e53d266778e770a05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_ruby::init: FunctionTooLong \u2014 microsandbox_ruby::init runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de45dc0e053aa918f70de068c2633acd6a83b4ccca6357e3c66208a8a40a8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: microsandbox/types.py: FileTooLong \u2014 1326 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 826 over it, 2.65\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":"sdk/python/microsandbox/types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"141780cba5152ccee4cc1368515a6ffc9dc8ced9c88f6104f7e1da8e9efc8a9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TcpProxy.try_run: MethodTooLong \u2014 try_run runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"487844f945c72ef6aaaae8b9a0715338905c9dbf25379c3f0bf195191571114d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/session.rs: FileTooLong \u2014 1290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 790 over it, 2.58\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":"crates/agentd/lib/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adddff32fe9fee62254b75427068bf75a0f16cfb5e796c13c01250c06a6a6887"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/sandbox_config.rs: FileTooLong \u2014 1271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 771 over it, 2.54\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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b12d0fa0c65da61f9cb81a1af979779238e2a8ce7bbbe801edca114568cdde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeControlExecutor.execute_locked: MethodTooLong \u2014 execute_locked runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abbe5ee116acb854cd7b8c4a06ffddb5e171b06566a9f53a3d829a018ded5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::helpers::sandbox_builder_from_args: FunctionTooLong \u2014 microsandbox_py::helpers::sandbox_builder_from_args runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"sdk/python/src/helpers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"78628067698c16448ec1d65081e07468f6b69ca0f8f62e9194bbc5b35049a556"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/client.rs: FileTooLong \u2014 1248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: Registry (2 blocks, 69-1381). The bar is 500 significant lines; this is 748 over it, 2.50\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":"crates/image/lib/registry/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da560a2b4a6ca4a25f32e691e7e7fd64d567df400f8f6697c69ef34ca638070"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PySandbox: ClassTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 3 blocks, lines 29-1554. The bar is 400 significant lines; this is 548 over it, 2.37\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fea23e02095538e33eae1164cc188955af4a9cb4c88c9b8720112ab4951b853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/napi.ts: FileTooLong \u2014 1184 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 684 over it, 2.37\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":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d27b07e6412f33c8f8e963f263684f9a79498b3a8db95aca953550291f8d5e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalBackend.materialize_archive_for_child: MethodTooLong \u2014 materialize_archive_for_child runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e359be49724a44bc7a48250ce0d4c88a698aab45c30aa7d93d2833a6a1c9c0b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/downgrade.rs: FileTooLong \u2014 1171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 671 over it, 2.34\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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fe844f260cadbe5b9c50f7cdc1293745822fa6c303c081c4691840a87f482a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::inspect::run: FunctionTooLong \u2014 microsandbox_cli::lib::commands::inspect::run runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\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":"crates/cli/lib/commands/inspect.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf77a355914a7928167540b0f9e7c5a8076641cceed6eef03a3629e7e3b33ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/fs.rs: FileTooLong \u2014 1148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 648 over it, 2.30\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":"crates/agentd/lib/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8da1ac7bec01d5700d9fc376d2d2ff0e93d474ba0fd3496bcac158da75b65d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sandbox: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc47b75fc90abb9cf611423e5be898b2b645a6e0473debcc0a9319367c1a068"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SecretsHandler: ClassTooLong \u2014 873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 2 blocks, lines 80-1819. The bar is 400 significant lines; this is 473 over it, 2.18\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5692a572dfd773a9cb4e157409aba2d0fa30f1d1759349745e3dfe39874c032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.request: MethodTooLong \u2014 request runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1442cf7fc9359e4bfeb1bcdfd756b363d59caa05e1dedf69d093fd4946fab5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsSandboxBuilder: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\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":"sdk/node-ts/native/sandbox_builder.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9480968a8f8c97170d9e2798e6d29d5d046536bbe6c76a706c51967449eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySandbox: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"40db811a43e9fab829b2e2c36e318ae18d73f4c629aa3dcca3ae64aadffd8b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Migration.up: MethodTooLong \u2014 up runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\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":"crates/migration/lib/m20260410_000001_erofs_image_schema.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59af114a0d6306de0b836873be2d8f72465c78d640c9ea9c1c08e2fe2f2e36b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.run: MethodTooLong \u2014 run runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d673680a8257d7495144703f1e3ecc160f327284ad255b9fde5e8878eea8d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::batch::load: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::batch::load runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"sdk/rust/lib/backend/local/snapshot/archive/batch.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da8e7eac79cca71e12214f5c530c19c7b12b020acac36c86218fe293e415f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::machine_cmd::run: FunctionTooLong \u2014 microsandbox_cli::lib::machine_cmd::run runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\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":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95231973af197b3dca42335fe6a03daa6e13858c95ec047054360c309d9c84c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Registry: ClassTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 69-1381. The bar is 400 significant lines; this is 424 over it, 2.06\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":"crates/image/lib/registry/client.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2f7e60f68645cd38e67d84ec605129c4d8d8e556bab2d08d0b5dc77f5bb8db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PassthroughFs: TooManyMethods \u2014 61 methods, declared across 10 files: windows/inode.rs (14), windows/metadata.rs (9), windows/remove_ops.rs (8), windows/mod.rs (7), \u002B6 more file(s). The bar is 30 methods; this is 31 over it, 2.03\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":"crates/filesystem/lib/backends/passthroughfs/windows/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d134c49c75ffc8c3a8a9a61d76c3010409030fd555ad16725d00fd722612c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sandbox: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\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":"sdk/node-ts/src/sandbox.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e64c92eda66c21ff4bc3ae699c4d27bfff156b5f84befa6ad604920968aeb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migration/source.rs: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 513 over it, 2.03\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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c82f1204dfce8f8a3f773957da004b98667f079e92a5af18ae7c4de5a83688"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/disk.rs: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 508 over it, 2.02\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883e73ad45c0e5c9a37fb3bb3a0a512cc36020af5cd0c29b8527986f993c486d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: go/options.go: FileTooLong \u2014 1003 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 503 over it, 2.01\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":"sdk/go/options.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb1309d767c1364f7089e410d3ae8688a1eb7519e76d5e002e251833bc29a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentRelay: ClassTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 496-2428. The bar is 400 significant lines; this is 396 over it, 1.99\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"940379ba4c8e4ac5a51546172a9557df4f301ff851098abe35e4300e2058e829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/migration.rs: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 490 over it, 1.98\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":"sdk/rust/lib/backend/local/snapshot/migration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"147024bb42874c6e462f6dc2b7a714316755f831ffb8c3cf0ef92b397fd089d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: udp/relay.rs: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 487 over it, 1.97\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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1127cf47959b03318d7ad5610022465d56a9b296d4178b8a068ed766607b218"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/sandbox.rs: FileTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 468 over it, 1.94\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb78f63ed79cc3a7f9339c9095ee34a3527583e9ade9869546392246cc243b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/registry.rs: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 463 over it, 1.93\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":"crates/metrics/lib/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a70631a201420f00c9cb45d517ff8daff0751853850645f029cfbd8c72499e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::create::create_snapshot_archive: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::create::create_snapshot_archive runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e761e205c0b9eee96f51a3e5e093a6f7e3156312838cca6411ca5295bbed1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/config.rs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 439 over it, 1.88\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":"crates/agentd/lib/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22375f474fd1ecbed7e1679a7e51d88503ab3d745ce0ea28e94b0e52c31a933"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/optimized.rs: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 423 over it, 1.85\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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace56bef6973ec79e9feaaa9373fe1ad1a4f0b80930b038e4a716f8f2b73eaa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalCache: TooManyMethods \u2014 55 methods, declared across 2 files: cache/store.rs (48), cache/lease.rs (7). The bar is 30 methods; this is 25 over it, 1.83\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":"crates/image/lib/cache/store.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec0e697e456d207edf6fdb174b2e7bf9bf3e2a425ac5c47d38978ff5dece8f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: go/sandbox.go: FileTooLong \u2014 913 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 413 over it, 1.83\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":"sdk/go/sandbox.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf936e63fa12c35eb73ef9ab38a3af4e247c1c9f31a860f8630d709a1298741"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::ext4::resizer::grow_storage: FunctionTooLong \u2014 microsandbox_image::lib::ext4::resizer::grow_storage runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6800f8bc077116f8f47fa7d2744122d99682d13bc616258260c0c12834f7a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CloudBackend: TooManyMethods \u2014 54 methods, declared across 6 files: cloud/http.rs (21), cloud/snapshot.rs (13), cloud/mod.rs (9), cloud/sandbox.rs (4), \u002B2 more file(s). The bar is 30 methods; this is 24 over it, 1.80\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":"sdk/rust/lib/backend/cloud/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcddae75b4c74d63bd5b48b4bffb8e0228c23a6239a792e5202bff37727a98d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::ext4::formatter::draft_directory: FunctionTooLong \u2014 microsandbox_image::lib::ext4::formatter::draft_directory runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b76427a1a57322146e664829dcd2d954a50da8d543a194a6271dcc2bbe7d508"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::agent::bulk_writer_task: FunctionTooLong \u2014 microsandbox_agentd::lib::agent::bulk_writer_task runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"422b60f0aadfd1c0fde9d1ef1ae223e33bdf2fe86539873c4c90e9dd02571683"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::common::apply_network_opts: FunctionTooLong \u2014 microsandbox_cli::lib::commands::common::apply_network_opts runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a047188258ac9a6a2e434881bb6ade60138e1a322ca7d32c24cf85d50092944e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Migration.up: MethodTooLong \u2014 up runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0e640233abf6632997c82fd64b62361f526a3656e518bf749c41570543f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::relay::ring_reader_task: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::relay::ring_reader_task runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b450280c75af602de50ea337d78440e11c92d03647d1ea1c16d105271412011"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::archive::docker::prepare_docker_archive: FunctionTooLong \u2014 microsandbox_image::lib::archive::docker::prepare_docker_archive runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd3f504bf1017e3f8779dff57613f725a38a51efa70aa9e14b568d12f6b6fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::runtime::launch_input::legacy_env: FunctionTooLong \u2014 microsandbox::lib::runtime::launch_input::legacy_env runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"sdk/rust/lib/runtime/launch_input.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d7ade1456c7f0f2d460a2c15c2c775a00d02b45d54b4af9d3cbab38ba50006"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: archive/delta.rs: FileTooLong \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 383 over it, 1.77\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":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af1da37b1a998c9c8eeb99969d87b4737cfde7d26fdb4bdddad76bc6b0ec740"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::runtime::storage_aliases::discover: FunctionTooLong \u2014 microsandbox::lib::runtime::storage_aliases::discover runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"947195d211ce50a2de7b0f2f589d1748df54bc132ab96e37f334501938a4d793"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tcp/proxy.rs: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 364 over it, 1.73\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb839b82ee237e997807701608f47148e4648959c9b3ae057c32968fe7d7c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments: FunctionTooLong \u2014 microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\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":"crates/metrics-collector/lib/exporters/otel.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c03f7af970058f3c2a895257b6addff6dab5a27fa7ec6ca1c823e4994bc1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::archive::docker::prepare_oci_archive: FunctionTooLong \u2014 microsandbox_image::lib::archive::docker::prepare_oci_archive runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5fa05482f5f9cafa47ad5f7243a34669ed8cde76dea5a18e484cb3463c78ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::helpers::apply_mount: FunctionTooLong \u2014 microsandbox_py::helpers::apply_mount runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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":"sdk/python/src/helpers.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ca7dea9e6afbef2e3751258d2c1980077e1678fad5655dc1b421c55654997"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::downgrade::load_candidate: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::downgrade::load_candidate runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a49701471d8db3f20cd10f2b71de51ec16c04b516385b94242e68fcd1842bee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::fs::handle_fs_request: FunctionTooLong \u2014 microsandbox_agentd::lib::fs::handle_fs_request runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":"crates/agentd/lib/fs.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7631b04f39907fe91c1bb65004080bb9c4f85c578dbec833bd0d9541efcb8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ext4/resizer.rs: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 341 over it, 1.68\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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfa2006c3042db01f3417936252e6ba403e86703979960e940168b865c41e41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: erofs/writer.rs: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 340 over it, 1.68\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":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f880290cbb189ae94d27f3bdb26949ac22da83cca9de7602e8487e263c68605b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sandbox: TooManyMethods \u2014 50 methods, declared across 8 files: go/sandbox.go (35), go/exec.go (6), go/jobs.go (3), go/logs.go (2), \u002B4 more file(s). The bar is 30 methods; this is 20 over it, 1.67\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":"sdk/go/sandbox.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"074de71e93d33c512de0aed85de52291a8c175e4b539d98c7fe564269c1b2570"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SandboxConfig: TooManyFields \u2014 50 stored fields beside 1 method. The bar is 30 stored fields; this is 20 over it, 1.67\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":"sdk/go/options.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b385e85cd69e065860f384cf35899be287c8f2a71c5086d98bb56660aa64d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::checkpoint::migration::source::recovery_views: FunctionTooLong \u2014 microsandbox_runtime::lib::checkpoint::migration::source::recovery_views runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3873d52924ccc26466ce8d9f40aeae61d96b8a2d41b3642a82319f606bde99ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_go::volume_mount: FunctionTooLong \u2014 microsandbox_go::volume_mount runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9a8a677a7b5ef126047a4280cc540b3a0382f5f79081cd4611db289badfaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Layer.download: MethodTooLong \u2014 download runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"crates/image/lib/layer/download.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd44f6745ae9c359ad26edfdfa09d70318e4fea523e72388643b9b112759656"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_node::native::mount_builder::to_built_mount: FunctionTooLong \u2014 microsandbox_node::native::mount_builder::to_built_mount runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fde9138445bb333114bc247dbe69837eafa61d0476d7ee037b8fd28deabddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migration/engine.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 324 over it, 1.65\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":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb962cb80faef467dae9aee52d1eae907c9def8c30275ad9e7fcc4074e22461"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ports/publisher.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 321 over it, 1.64\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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f662d0e4f4e3aed0ca9a8f7cea0612bbc4dc6961beaeec7f53cf65a4b0c18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_go::msb_sandbox_create: FunctionTooLong \u2014 microsandbox_go::msb_sandbox_create runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"2724dbbb40d650e83bbf01fa7eb8780feeaf81b256f9c31e3a640571e1de41cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::dualfs::remove_ops::do_rename runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3c92b22cea8497a78d82ed226b96f8aad82884536c8fd23c84fa14d155c5b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/storage_aliases.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 310 over it, 1.62\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":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e9354728925a31cd30f6de3e6250355ee29185632d2cf4ce8ef2ba38c1c5e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::save_snapshot_expected runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a25deeccfa419a15ce16aa9345130be92f5bb331ba8da27bf014f2442f3af7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JobManager: ClassTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 2 blocks, lines 48-1035. The bar is 400 significant lines; this is 244 over it, 1.61\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c5ec18b7124174c1a2c467ca00ee735d8259c78627b7845ace8d3bd5dfe991"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SandboxCreateOpts: TooManyFields \u2014 48 stored fields. The bar is 30 stored fields; this is 18 over it, 1.60\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"8385ddddab2242cbc4b88c8ad6a275cec4a3166aef57b919bfde110dec05eddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/mobility.rs: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 298 over it, 1.60\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb03d919524ecb3ebd68ee7455943c620139cfbc217c751eed2feb26100b53a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecSession.spawn_pty: MethodTooLong \u2014 spawn_pty runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"crates/agentd/lib/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a284d88962b934bc0ca30ffaeb05f3fe7cbad161f525021a9f86f5a2a2f31cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/jobs.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: JobManager (2 blocks, 48-1035). The bar is 500 significant lines; this is 284 over it, 1.57\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d03ca19ab7ffa869f3efafcd59beb3f6f1ba2290a65cbfc158e9b4b70ec5295"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db: FunctionTooLong \u2014 microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3bd156d0863a6c29f36d09d378767405bc27dc0fa23c953732180816dabddd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SandboxOpts: ClassTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 117-1214. The bar is 400 significant lines; this is 215 over it, 1.54\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8926bb434d4b7c3427abc77d3e640586e7cca2c5eb90c725c5723d768f60c703"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::helpers::restore_builder_from_args: FunctionTooLong \u2014 microsandbox_py::helpers::restore_builder_from_args runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"sdk/python/src/helpers.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"674ba15e345b271a69f3372587f7da7835a13f4e9c21549b695675374a36f019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/mobility.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\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":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"093fabd5a1181a078d99ed06983a7e883f93c26e3ac3f43a83cdb14c36222d05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::cpu::allocation::acquire: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::cpu::allocation::acquire runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e16e5dfaad8b584257c25cd45081205869adbc6a616d69eb915c02d38a22f72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::relay::route_guest_lane_frame: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::relay::route_guest_lane_frame runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d387a84a5de4742815cd15443d8ec7702db6b64cb7b5ce8cd28b3e5f0f022263"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/inode.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 235 over it, 1.47\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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc322e26d9a68b4a027e911f690088c60b670c712a7cc6aba3a42dcd3da0b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: erofs/fsmeta.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 225 over it, 1.45\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a112e9cce9fb43174b54a5f17fe1c3b6e16c43dc36b29e86eced12c73ea1b9d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: netstack/poll.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 225 over it, 1.45\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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438bc94e8ca2501fd239ca180dda42d77d8daba844522858e34e6bd2f50e04e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::ext4::resizer::parse_and_validate: FunctionTooLong \u2014 microsandbox_image::lib::ext4::resizer::parse_and_validate runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"55782a7784101144b771e591273fe663b8c296cf525269304420873aa4da9129"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_go::apply_network: FunctionTooLong \u2014 microsandbox_go::apply_network runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"336d5b71bb7bb4dbbd3bba91bf46094a7aa7575b900422af7332dedd798ce462"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/launch_contract.rs: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 217 over it, 1.43\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":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b96b2e4d7b5408e13037dc0ccbd6d7ce24dd1f5c0653cf759b6213ece4b7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsSandboxHandle: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"sdk/node-ts/native/sandbox_handle.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70fb5c81c977ca1d43ca64b53e12ca258e8e95c6928d087395d94cafb2177b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::checkpoint::migration::source::select: FunctionTooLong \u2014 microsandbox_runtime::lib::checkpoint::migration::source::select runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46844881e363639d23ad75ef6a95dece8a9b1488636ea259e7345f052ae271a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_go::jobs::dispatch: FunctionTooLong \u2014 microsandbox_go::jobs::dispatch runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"sdk/go/native/src/jobs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9782bfbf8bac690c74899ee0ba2d4d11d3680f36620705b22e5cc34ee6d5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_ruby::apply_builder_options: FunctionTooLong \u2014 microsandbox_ruby::apply_builder_options runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b798881c01ab13543e9632826a85b388b47ab3a5a7b0a0e0cb948b2a987d6207"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::build_archive_inventory: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::build_archive_inventory runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfac91286719169220368bfaa17988a5db84cee2f38396a871aa29d12dea2be7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::create::capture_installed: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::create::capture_installed runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb2917881c9444c22edcf5be48fa2742ffe6a596f24aa4ebcf5d9e1ec08e3ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::tar::ingest::ingest_tar: FunctionTooLong \u2014 microsandbox_image::lib::tar::ingest::ingest_tar runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ebfda95aa79f82d2e0a265bca3374ca9a47a00acbb1db9b1e47b9f63a05f2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::validate_archive_inventory runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"47809a0a67c591656a7f4208d5fa55864c91c5541182ee2882be2b2db5c70d8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Registry.pull_scoped_inner: MethodTooLong \u2014 pull_scoped_inner runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/image/lib/registry/client.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"e765a282202f97dd1f521f205be6631a83918bfb37bc827a183680f26a61bd13"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuntimeControlExecutor: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 32-787. The bar is 400 significant lines; this is 150 over it, 1.38\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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00ddb5fcbb27a0795974455fd12c255872dccdf04a9fac09ad2c5b36211cb2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control/executor.rs: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: RuntimeControlExecutor (2 blocks, 32-787). The bar is 500 significant lines; this is 184 over it, 1.37\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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a18eb22ed951394acccc51e1b269eb7bfe768b256f76ce052cac44016de97db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SandboxHandle: TooManyMethods \u2014 41 methods, declared across 5 files: go/sandbox.go (35), go/jobs.go (2), go/logs.go (2), go/compact.go (1), \u002B1 more file(s). The bar is 30 methods; this is 11 over it, 1.37\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":"sdk/go/sandbox.go"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9aa915b90337be131dd3bdb805d6ea943f564523a00ccacd2c6b45018f19b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SecretsHandler: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"81472c89c42af5db10600cd98fb75483d9d6f74eeb2c71d6c2b8230e7b7b1683"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySandboxHandle: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c0d4fddcf61a1bb1bd5aea3fa03f65963c6be2dc767779a0faaac1d54e07db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: erofs/reader.rs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: ErofsReader (2 blocks, 28-805). The bar is 500 significant lines; this is 177 over it, 1.35\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":"crates/image/lib/erofs/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818f81196dbcdf9fa15b808a7780e3728173c673102611072bc28dc0998e74f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsSandboxBuilder: ClassTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 3 blocks, lines 58-952. The bar is 400 significant lines; this is 140 over it, 1.35\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":"sdk/node-ts/native/sandbox_builder.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d86fe14d5356fb977643a5f63ccbf228adb7fac9f40d1f7dabb3d5d12209b52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::helpers::apply_network: FunctionTooLong \u2014 microsandbox_py::helpers::apply_network runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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":"sdk/python/src/helpers.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a986da1071d89c45babe1114854583d2c5334c23f3762210c4bf99325acd5b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/init.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 174 over it, 1.35\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":"crates/agentd/lib/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76c277d89c4c003072a4b5a789a6c0dde4fb068f9524705c92c5715141b15bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/mod.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: PassthroughFs (4 blocks, 196-1036). The bar is 500 significant lines; this is 174 over it, 1.35\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":"crates/filesystem/lib/backends/passthroughfs/unix/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bccc2495024a6d7bf1c8a0ada7deb9a215ee8c3d637dc2cdbbd6a1ede4f47e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsSnapshot: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 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":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"946ea3b0a4ae79c87eb32f558fe757eb673da6be15693e0a5c406011ed16cd6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::common::parse_cli_mount_options: FunctionTooLong \u2014 microsandbox_cli::lib::commands::common::parse_cli_mount_options runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e05ce056784afe3d1bc3b56514d0547eedb7cb05ba46017225f932b1150fd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VolumeMount.deserialize: MethodTooLong \u2014 deserialize runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"packages/microsandbox-types/rust/lib/domain.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"444683f1c795f3f907fb7a139b6e39126bd944da26f1c7b485df6e29683011d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ee25ed70e79e1716dac1f4ee87e717db8bd2cf79534db5093a9944fc939acb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Sandbox: ClassTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 3 blocks, lines 34-926. The bar is 400 significant lines; this is 125 over it, 1.31\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"74edac9fba025d85c46383392ef08d06a5a42e21aa6f660d8e43f02c5282ca90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::vm::parse_mount_spec: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::vm::parse_mount_spec runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4698a3a0d3c36eafa8b270e075c0e62eec88a31c046491323f104dfe803268b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubySandbox: TooManyMethods \u2014 39 methods, declared across 2 files: src/lib.rs (36), src/jobs.rs (3). The bar is 30 methods; this is 9 over it, 1.30\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0cf50458a4b384637d3a196510357044cfc524c5781295a06eb9a5e2f13b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LaunchConfig: TooManyFields \u2014 39 stored fields beside 3 methods. The bar is 30 stored fields; this is 9 over it, 1.30\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":"crates/runtime/lib/client/launch.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"18080d115e4baddfd768b423973e89e3bf5e1479d49c635f7e96caea90fb0ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MemoryCache.materialize_with_baseline_inner: MethodTooLong \u2014 materialize_with_baseline_inner runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"crates/runtime/lib/checkpoint/memory_cache.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5f3ee41f8e081476bac53db255a762e8b355d2cbe73b86bad93b84820674be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::write_direct_archive_entries: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::write_direct_archive_entries runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc238ac33b15d427e0cb5be8e1d017b3e2247c450cf15037076da2872e627d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::dualfs::dir_ops::build_readdir_snapshot runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7d36e98d2acd0e70506b7df2306a280fffa1998224af880d6cc69f9715a705"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::memfs::remove_ops::do_rename runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac48b51e9b1316753caf692f729dd8c48b8145fd925ef11e25ffc12b540f5d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa4ab4ce74c14ef5673555594f3d2d4c27386569115944880d390d14bb39a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_network::lib::engine::dns::windows_resolver::compatibility::convert_rdata: FunctionTooLong \u2014 microsandbox_network::lib::engine::dns::windows_resolver::compatibility::convert_rdata runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"crates/network/lib/engine/dns/windows_resolver/compatibility.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"391f1921d5d831506f426473ad317f194ad8e6126d7987becde32305955e8f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SandboxHandle: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"68165bd5ab9724f3c0ed9fbe4317b0ba809b567d5369d0aa59a4e53ecc8463f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: VmConfig: TooManyFields \u2014 38 stored fields beside 3 methods. The bar is 30 stored fields; this is 8 over it, 1.27\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a3a82ca5142d4650b0e174ddc55590dbd1844dfb5b849db6e2894fa7ee83b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointCoordinator.capture_disk: MethodTooLong \u2014 capture_disk runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"700c405ef0b80e14be70857ef139e368b0c5fb58930d4d7d5032b89fb50f611c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/group.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 128 over it, 1.26\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":"sdk/rust/lib/backend/local/snapshot/group.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bae77fccbb4fc4d8670292e7ba36b030fe6d2b167451a36086c923ba43d15c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/owned_disk.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\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":"crates/runtime/lib/checkpoint/owned_disk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b73b5499e0f14cb9b90d2253e8101553fc1b296fc34d30583882f78bd8bde7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BootParams.from_bootstrap: MethodTooLong \u2014 from_bootstrap runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"crates/agentd/lib/config.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33544b8a7eae07d68f680b9c02fb9877933ef90fb2bfe497f5461969fd8727c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalCache: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 2 blocks, lines 78-928. The bar is 400 significant lines; this is 99 over it, 1.25\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":"crates/image/lib/cache/store.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd634290db21a1094d6c92d5451314eec8a17039abe03e779504b483f8146b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/store.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: GlobalCache (2 blocks, 78-928). The bar is 500 significant lines; this is 122 over it, 1.24\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":"crates/image/lib/cache/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ec9693f0425f547963b267072c74195b5e3003da7c89c9847303cb466f7d49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/ipc.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 120 over it, 1.24\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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82af43c1aeaeb7648540924705b906eab374bd0ec198a86df1611b27c2dcfc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: microsandbox_filesystem::lib::backends::passthroughfs::windows: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\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":"crates/filesystem/lib/backends/passthroughfs/windows/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae6cabecbfb26b9a99489f268e4a44d52ec881106e73f69efa1d0c40747640f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: microsandbox_filesystem::lib::backends::shared::platform: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\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":"crates/filesystem/lib/backends/shared/platform.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be51d3bdce7a1a6d6936480c03826752a4bd982e3a7cc2d10086635a3c1eb9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsRuleBuilder: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"sdk/node-ts/native/network_policy_builder.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a441736895756312fa79b1c2b9b127e4f17912e27f844dedae4e714277d3fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySnapshot: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"sdk/python/src/snapshot.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"228db1c7d5ff010d612cc5921c629d4491976c1b8f68f30c17c73517664b6d05"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PassthroughFs: ClassTooLong \u2014 493 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 196-1036. The bar is 400 significant lines; this is 93 over it, 1.23\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":"crates/filesystem/lib/backends/passthroughfs/unix/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8156c30b0d02985e69e90e92a998163aadf95fbc58ec0b8ca0a9df3cc2c8e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/tcp.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 116 over it, 1.23\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":"crates/agentd/lib/tcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5b1b10efee457053a57ac93bc0627da759982e7c9e1766ec5ce66ace9866d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dualfs/lookup.rs: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 114 over it, 1.23\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":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1eec45593ffd94f5aa9ba837ea3fd13b11207eff2c6c192b16d38a5022b625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/snapshot.rs: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: PySnapshot (3 blocks, 23-692). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6c9ebd3eb7c135f72503b325de8fd7635e0e2bd4b1e0d9c7c228b204f7b35d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox.buildFFICreateOptions: FunctionTooLong \u2014 buildFFICreateOptions runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"sdk/go/sandbox.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"595245dffbe4161cedd9264bebac3f6827381a393c23a1c59cc1b5f072a133d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner: FunctionTooLong \u2014 microsandbox_runtime::lib::checkpoint::migration::engine::plan_inner runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be78120ec0279eaa49df3bc47fe7cf8e66a09dace8412b2fd7c0de73c75a4df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/sandbox_builder.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: JsSandboxBuilder (3 blocks, 58-952). The bar is 500 significant lines; this is 108 over it, 1.22\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":"sdk/node-ts/native/sandbox_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1496edf93cd1bb27872927a0a06c23ef077e9af73a04378cc408e0338ab794"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobManager.start: MethodTooLong \u2014 start runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198351eb299c62e8777b388a012524bef34b81ddc633530e292fcc1289356a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentClient: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eae324f00fce8d162a499abf178c29b6819bd439fc184fe3d3e8771d45994e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PreviousLaunch: TooManyFields \u2014 36 stored fields beside 1 method. The bar is 30 stored fields; this is 6 over it, 1.20\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":"crates/runtime/lib/client/compat/launch.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a4c3faedd78343525009f0ac6ab6ae950283777d7c2704829caa735201bdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::passthroughfs::unix::remove_ops::do_rename runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"26895bde0dab4cd772e7fbf4391727f28bb40c642f21e9045b014fac85fe6b1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode: FunctionTooLong \u2014 microsandbox_image::lib::erofs::fsmeta::write_fsmeta_inode runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afd73cc0cc3ce41becb5e9cabc8c46615dd4d5ee22cd97cadfc5d9cff4099c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalBackend.verified_metrics: MethodTooLong \u2014 verified_metrics runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"sdk/rust/lib/backend/local/metrics_lookup.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"59455c346df73d8c14f6602b2c0883f7c98da96717c42a14c85ccc441c6bc58f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current: FunctionTooLong \u2014 microsandbox_runtime::lib::client::compat::v0_5_9::launch::to_current runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1543648c392e68d2b2c6743aac481ae29bdbfe240f6800f301e8a3078cf87bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PySandboxHandle: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 3 blocks, lines 20-704. The bar is 400 significant lines; this is 67 over it, 1.17\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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2064ca8dd980d9d9a51021f733dcf493a78c3b6ce81be9264269f718b8fd0ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ErofsReader: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 28-805. The bar is 400 significant lines; this is 67 over it, 1.17\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":"crates/image/lib/erofs/reader.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caa41e894f203023d3cb87b442ca9c43beb81ff30d04d6d5e2e095cf0fe9f53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuleBuilder: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"crates/network/lib/model/policy/builder.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efa4b300050939018f904fbb9eb2050697afe9bb0b83ff857c4484aedcb5a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/network_policy_builder.rs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 79 over it, 1.16\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":"sdk/node-ts/native/network_policy_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49069705a7712d82702e0ba0fd757dd280831c26e4296474e7ddd92e42fd8339"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/copy.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 77 over it, 1.15\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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d3f5ed7846bb029f2acb1f726f97e2dd720aed51b215694f60929f4b856d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/image.rs: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 72 over it, 1.14\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":"crates/cli/lib/commands/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff56a58e570543a3ef6d3bbeae00c93211e7948329ee38828e579cb055b2403b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExecSession: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 4 blocks, lines 145-1387. The bar is 400 significant lines; this is 57 over it, 1.14\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":"crates/agentd/lib/session.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaf94dbfce22c2187f213ab4046c41f14c1ddaec490c8c8e400bbf9798673fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/store.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 over it, 1.14\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":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579bfea505c70fb7d533f1a74b62eab323edd4eed2214aa959f6c1573fb8652b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SingleFileFs: ClassTooLong \u2014 455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 55-697. The bar is 400 significant lines; this is 55 over it, 1.14\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":"crates/filesystem/lib/backends/singlefilefs/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb6a9bb5537a8cd5f462a9f004beaf66142cba22a1f5071058ca1c9f8bc8f37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsRestoreBuilder: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d6ac8f3440d4871d664c9e34c3878b472c28324354bf0a2fb7f09e7fa4515"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner: FunctionTooLong \u2014 microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"663bac7d633dff30fc3515685f757e4c68da70121a1de00cceb14bd0abd60a46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::common::parse_secret: FunctionTooLong \u2014 microsandbox_cli::lib::commands::common::parse_secret runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"931642e0a169d07eeab6bdb6966989a181bf29d35c705d751db743d12ad515f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SecretsHandler.substitute_ready: MethodTooLong \u2014 substitute_ready runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59214c574f09903c62ceb630934bd02dc3f1dcae72466201651f350712724a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_node::native::pull_progress::progress_to_js: FunctionTooLong \u2014 microsandbox_node::native::pull_progress::progress_to_js runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"sdk/node-ts/native/pull_progress.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d98082695a7e485b8ed5bf649600183d7af2989f8ca8c5e4cc56d21af27499"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::write_archive_entries: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::write_archive_entries runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e077cbe6c99445043ed1c7f5a27789e0c1109808faa12ef63d4c6e8f1b2a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/config_patch.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: PatchField (2 blocks, 16-598). The bar is 500 significant lines; this is 63 over it, 1.13\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":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da75f85c42bfd2fdc81e5f51a4f4eac782c271bb249c0bbdd45b053f6e289bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/http.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede852ea0a52feee1d1e0bd6d7683933b7b81f543e97b4f2c3b4b728aa9d11ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::passthroughfs::unix::owned_mobility::capture: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::passthroughfs::unix::owned_mobility::capture runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d69d6434089e411ef8a5cdd1c499e3ad3975661c353257cb3f754ba1f37396"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::relay::ring_writer_task: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::relay::ring_writer_task runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7dd788c02667a0ee3fc888aeab36a3344f82e41c944ea32152fa2b1462c191"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::restore::additional_disks::materialize_additional_disks: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::restore::additional_disks::materialize_additional_disks runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad79684029f852f3a5b3daef7ed88ac2d0bf7d871bef16b54e8d9dc2330f29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/local_shm.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\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":"packages/agent-client/rust/lib/local_shm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6292a80eac3d9c9a8ab491726cea88a88a1e9aba72d6ec57139fad9bd87c26dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_agentd::lib::agent::run_fs_bulk_write_worker: FunctionTooLong \u2014 microsandbox_agentd::lib::agent::run_fs_bulk_write_worker runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fe1d8102cad8d46b7d93777a50ce24bc283cefb6a35937bb09878d4cde09c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::writeback::admission::acquire: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::writeback::admission::acquire runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"crates/runtime/lib/runner/writeback/admission.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79d78dc4294fe09bd734a8b44825005157c908ac3ddcb35b0bf342c98994b58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_types::lib::secret_plan::plan::push_secret_changes: FunctionTooLong \u2014 microsandbox_types::lib::secret_plan::plan::push_secret_changes runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"packages/microsandbox-types/rust/lib/secret_plan/plan.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf126c9794a294a7d443d9f7d58293f5bd824a82b35374179b266f7afe833c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::create::build_artifact: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::create::build_artifact runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b526081d2d97f25c1964f9018f802834e76fcd11a790982a7771ca071b672300"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: policy/types.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 over it, 1.10\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":"crates/network/lib/model/policy/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e55ff2c91051802ead4957a82aa0caa8c1db8ebe3ae29e0c8b64b01784273"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/maintenance.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 over it, 1.09\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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc125f9b2cbbd6c8d2ee23edc4fbe9f75e86c7182bd7ccc165990037c1fe1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::dualfs::lookup::forget_one: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::dualfs::lookup::forget_one runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"3420facfc5bdb1d2dfbdb60f3a7e8f967ddd8299e4c0d194fc8945173a6c84d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SmoltcpNetwork.build: MethodTooLong \u2014 build runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"crates/network/lib/engine/network.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd501763c7b357a925204c0712813dae0f662ca7e028d9e42d10e047d9cd4d79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::try_append_sparse: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::try_append_sparse runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ef355bbc839c793a341559ab693b5d1dd92c71bf369c3c439171b259ac8fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::validate_inventory_snapshot_bindings runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16fbf92546115ec201c165578c810575617d38249d1868b702f781d4567636a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volume/mod.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 over it, 1.08\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":"sdk/rust/lib/volume/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff12a4d1aaa8f8daf59fe2cdb5e044078fb780cc499275f6f46c604c747f660"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TlsProxy.try_run: MethodTooLong \u2014 try_run runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"13676306e241490062a919730e2688c372d795366e54df759c6062ac92283990"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repair/interactive.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\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":"crates/cli/lib/commands/self_cmd/repair/interactive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae96906bfd057670a21e6d24b320601aaa8df7ea3ee62cf68bc85893d88576"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_network::lib::engine::tcp::proxy::handle_connect_tunnel: FunctionTooLong \u2014 microsandbox_network::lib::engine::tcp::proxy::handle_connect_tunnel runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bcdac02b0de1aa4e6a5515c9e5c48b01aaaa0da17c3c592822f4fe0aa48f91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointCoordinator.open: MethodTooLong \u2014 open runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b9a57d3c1cdd707ca4d59dbdcad693a0e6bb69f974c4dbb23dfd8c8f8f4121"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::create::capture_full_snapshot: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::create::capture_full_snapshot runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2dc0e45701568462c10485da07df5bcbbf128848c77aebb741e178fe38dba0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Snapshot: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"sdk/rust/lib/snapshot/api.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"691cfe95861bed5b3ad8102530d9301059b6ae19aa38490c8779841cde12205e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeOwnedRootDisk.rollover: MethodTooLong \u2014 rollover runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0076c6f39c85f91735ee9db27d15c4190efe15bc1c4a5e172d4261125aa44247"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PatchField.parse: MethodTooLong \u2014 parse runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc7f387cccf4c59797b100febade415b4f81bef2ca41d3c5c2b5d8707c9e682"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b624f4a2485bd9048726f2ea4bdbaf0a20311cb2462fd9a69535b7c5925c413"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exporters/otel.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 28 over it, 1.06\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":"crates/metrics-collector/lib/exporters/otel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8809bb8d69fc1c8db6b50c1b72fa73585033ce0ff944cb8baf7928fbc26f83b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PatchField: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 16-598. The bar is 400 significant lines; this is 22 over it, 1.06\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":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"173ebf479b5dbbcb35ee1803d436be29dd1b10708c172029a88bd41816e83591"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::archive::write_direct_checkpoint_archive_entries: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::archive::write_direct_checkpoint_archive_entries runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be66bed2e877d363fb17aaff78f05eb7dc95fb5100c771efdb796bc75e129e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::backend::local::snapshot::migration::pin_candidate: FunctionTooLong \u2014 microsandbox::lib::backend::local::snapshot::migration::pin_candidate runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"sdk/rust/lib/backend/local/snapshot/migration.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c8aac9bf9fdedfcde084177cad06e707a42c3b81d71a0f2488fdf35a55cbc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image/cleanup.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\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":"sdk/rust/lib/image/cleanup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd121c8ff554626c3fde26ed4b0d3a3591e2d75392a4b53113ec5e256bd2eb26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dns/forwarder.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: DnsForwarder (2 blocks, 91-747). The bar is 500 significant lines; this is 21 over it, 1.04\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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6980760e805ae7ba547eb5e124c43e1662b17ac4605e5b3f7fbc14ce3d33b3bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proxy/socks.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\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":"crates/network/lib/proxy/socks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bfc415cf3accd07592c004bebae61ec6ec32f9a29a35bf7f5713c905562d41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::capture: FunctionTooLong \u2014 microsandbox_filesystem::lib::backends::passthroughfs::windows::owned_mobility::capture runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8372324ac53bbfaaa469df7a66feaed912746544b8ef2f832b48abd312bb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: writeback/admission.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 18 over it, 1.04\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":"crates/runtime/lib/runner/writeback/admission.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"106ef8205a49e96189aac62433a9bd077c549c2e14ca4c53ec3592b107f3f08e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkBuilder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"crates/network/lib/model/config/builder.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c723e1a7a69fa7acda80a569d5c96a538a21b7a8fc65249d506549ea27b49029"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"packages/protocol-client/rust/lib/client.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d75c7ada2864c251d370d3869a8b5f10e66db0c0e267f1b777b35d46e41949"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsNetworkBuilder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bde3f97fb2ea38841425a84705a8c2426895c8db2352126d49d7305a1d740b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubySandboxBuilder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c1acb375ee693e6ea1991e0c185ce4f8d9562b386a6182485db2f56ff12423"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_cli::lib::commands::image::run_pull_inner: FunctionTooLong \u2014 microsandbox_cli::lib::commands::image::run_pull_inner runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"crates/cli/lib/commands/image.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6aa0d9fe76dbbe6040c0cfa81a5200bc1817c1574ad6d4aa7589351654dfe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::runner::cpu::planner::plan: FunctionTooLong \u2014 microsandbox_runtime::lib::runner::cpu::planner::plan runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"crates/runtime/lib/runner/cpu/planner.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"180dd625c9896615b31d3d00f89c0f656f24bd2cfffdb90a626cbc904e22cf7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::helpers::parse_network_policy: FunctionTooLong \u2014 microsandbox_py::helpers::parse_network_policy runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"sdk/python/src/helpers.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8158fc39d58d77b9b26c3d0119d4abdddecd355b57baa5e39543305736b6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/snapshot.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\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":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6927deb8cb396606a1dee664bcdc40b715ffc3c86e029e5c6c779f8f1ae842"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sandbox_handle.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: PySandboxHandle (3 blocks, 20-704). The bar is 500 significant lines; this is 14 over it, 1.03\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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09caaa6802633a61f267a097a23173760fe018ca343fd2aac02607e14b170921"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image/mod.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\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":"sdk/rust/lib/image/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e359cceb7fab2dabd77a962f83d4eff7717e5c87b80c8857aa7ef43897a5b9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/sandbox.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11 over it, 1.02\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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9acf2dec30efc6081d198207018fa567668abc4ef403b2148ab2cd2be28282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/model.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 10 over it, 1.02\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":"crates/image/lib/tree/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890ab921f2514cf889de211ba9a8394b818e9457d4ea1db7fb7919fb14e735c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates: FunctionTooLong \u2014 microsandbox_runtime::lib::checkpoint::migration::source::metadata_candidates runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9225af65654b3cd5854c40858315bc8284f0c7819695768e4d69c235a2ffd91c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox::lib::runtime::storage_aliases::resolve_with_catalog: FunctionTooLong \u2014 microsandbox::lib::runtime::storage_aliases::resolve_with_catalog runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"be225f97e991736198d40f5a5c704df8590aea5a43718fc77a5de09032221811"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: passthroughfs/owned.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\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":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c40c653ace5e67f5bb0c57b51f628f9abbb7804b145c14a08cd5ccdce7b721"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: icmp/relay.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620523f0a625f487d1ead8cf1ecb5c2cc70c873b59a7ac88f3ceac0106a59ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tls/proxy.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\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":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3615b87bc126e6aa208bb4006f72700ac8f6d28447ec05d32de02f88ec9426"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: singlefilefs/mod.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: SingleFileFs (3 blocks, 55-697). The bar is 500 significant lines; this is 5 over it, 1.01\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":"crates/filesystem/lib/backends/singlefilefs/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b6d9c36e28d6ee7ca04596f040a0d69b85d7b95a0dce9afe97f0a11ed21982"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_network::lib::engine::tls::proxy::intercept_relay: FunctionTooLong \u2014 microsandbox_network::lib::engine::tls::proxy::intercept_relay runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a4cfcf73e14553f4c35128f8a4d13274724d89ce78742f0666002019ac6a09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: microsandbox_py::sandbox::build_secret_patches: FunctionTooLong \u2014 microsandbox_py::sandbox::build_secret_patches runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d75e588ccf67bdf671e76615a021f53516b504ef70c33f5aa53746cf7c71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 44 shared lines): crates/image/lib/erofs/fsmeta.rs:627-783 | crates/image/lib/erofs/fsmeta.rs:796-909 | crates/image/lib/erofs/writer.rs:969-1115 | crates/image/lib/erofs/writer.rs:1124-1221 \u2014 These 4 members are variants of one another: a block of 44 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f14256450b68811de0458c88163f294ed8e35586c00df8fdfb72596c19ab73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 31 shared lines): crates/filesystem/lib/backends/memfs/create_ops.rs:38-110 | crates/filesystem/lib/backends/memfs/create_ops.rs:121-185 | crates/filesystem/lib/backends/memfs/create_ops.rs:198-279 | crates/filesystem/lib/backends/memfs/create_ops.rs:289-348 \u2014 These 4 members are variants of one another: a block of 31 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/create_ops.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbc1301f0e60099617eb2c0ec2f2ddb11de122120d9f75cca776c8506ccf6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (109 shared lines): sdk/rust/lib/backend/local/snapshot/archive.rs:3192-3382 | sdk/rust/lib/backend/local/snapshot/archive.rs:3390-3575 \u2014 These two members are variants of one another: 109 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"169553418ae1c71a0dabb1fea204e3b0ea62095fdd0b87f552e664fadc4b57ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): crates/image/lib/archive/docker.rs:729-970 | crates/image/lib/archive/docker.rs:986-1224 \u2014 These two members are variants of one another: 80 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"89828fec6a57b6f7e6d33577aeb4c973b155db6255ff1abd7d6cc416bfbb3c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (76 shared lines): crates/migration/lib/m20260305_000001_create_image_tables.rs:106-321 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:153-408 \u2014 These two members are variants of one another: 76 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cadfcafb52d909660c8e0ebfdbcbe69577a822f05bc4dc36fb2e87ad1dc052"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (64 shared lines): crates/filesystem/lib/backends/dualfs/remove_ops.rs:25-133 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:136-225 \u2014 These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a333a0a9a723d57f2b83673dc4e2649e70450f3d346e4a38a6752a8468eb02"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): sdk/rust/lib/backend/local/snapshot/archive.rs:992-1088 | sdk/rust/lib/backend/local/snapshot/archive.rs:1104-1192 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e4afef91c153f4ea52c9ca8c0f2690ffdb9613c99c4e66d5f72f96de4b9d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): sdk/go/native/src/lib.rs:2172-2402 | sdk/python/src/helpers.rs:1049-1283 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2666bf6e1cfa0aed20ffc01b978d54517fead5b56f77f119b930a1d73baef52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:622-694 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:783-866 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d8b679d32b891b85ecf409afe0be1471aecb94e6cbf4fd551217c14a93839b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): sdk/rust/lib/backend/local/snapshot/create.rs:254-444 | sdk/rust/lib/backend/local/snapshot/create.rs:593-808 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dce834105f5481d85b5122cb5a42056e6d5e40eac3347a496c0e9d68fdf2015"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/filesystem/lib/backends/memfs/special.rs:81-126 | crates/filesystem/lib/backends/memfs/special.rs:211-243 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"crates/filesystem/lib/backends/memfs/special.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef6bb1d7e9f8a76a28328bc55de87fa0b5a7642f2a29eefb0b01e167a53299c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): sdk/node-ts/native/network_builder.rs:65-76 | sdk/node-ts/native/network_builder.rs:99-110 | sdk/node-ts/native/restore_builder.rs:285-295 | sdk/node-ts/native/restore_builder.rs:299-310 | sdk/node-ts/native/restore_builder.rs:314-324 | sdk/node-ts/native/restore_builder.rs:333-344 | sdk/node-ts/native/sandbox_builder.rs:585-596 | sdk/node-ts/native/sandbox_builder.rs:619-630 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a582d46649c752062e1fa615b5bbe225ba2ddd2bbd782e4ef1a164813a3ba30"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/filesystem/lib/backends/dualfs/file_ops.rs:144-226 | crates/filesystem/lib/backends/dualfs/file_ops.rs:242-328 | crates/filesystem/lib/backends/dualfs/file_ops.rs:337-401 | crates/filesystem/lib/backends/dualfs/file_ops.rs:414-493 | crates/filesystem/lib/backends/dualfs/special.rs:96-160 | crates/filesystem/lib/backends/dualfs/special.rs:181-255 | crates/filesystem/lib/backends/dualfs/special.rs:266-344 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a338a9fd40f64d2553ce076923bdc3bff6ed65c2079a8324203e2c0509557e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:4549-4568 | sdk/go/native/src/lib.rs:4613-4628 | sdk/go/native/src/lib.rs:4637-4652 | sdk/go/native/src/lib.rs:4661-4676 | sdk/go/native/src/lib.rs:4711-4727 | sdk/go/native/src/lib.rs:4736-4752 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"76be08b44dc0969208d44a98c09f4343c69c8197ad3de3b8318d5f824d5ddeea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:5887-5904 | sdk/go/native/src/lib.rs:5915-5932 | sdk/go/native/src/lib.rs:5950-5971 | sdk/go/native/src/lib.rs:6079-6096 | sdk/go/native/src/lib.rs:7306-7333 | sdk/go/native/src/lib.rs:7342-7367 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5887}}}],"partialFingerprints":{"codehealthFindingId/v1":"635387093f6cfcb2020df49d2b7c4dd99d6b0bf45fa55a245840bb3b1be32fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/filesystem/lib/backends/dualfs/create_ops.rs:42-161 | crates/filesystem/lib/backends/dualfs/create_ops.rs:172-254 | crates/filesystem/lib/backends/dualfs/file_ops.rs:34-130 | crates/filesystem/lib/backends/dualfs/lookup.rs:35-149 | crates/filesystem/lib/backends/dualfs/metadata.rs:100-202 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"112243443659f2bd00a03afd62070383b984af97f27f1d0bac83bf2a49dc7d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/filesystem/lib/backends/dualfs/file_ops.rs:337-401 | crates/filesystem/lib/backends/dualfs/file_ops.rs:414-493 | crates/filesystem/lib/backends/dualfs/metadata.rs:205-262 | crates/filesystem/lib/backends/dualfs/special.rs:96-160 | crates/filesystem/lib/backends/dualfs/special.rs:266-344 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b1dac0a1a8cc09b120bbe5cc6bec7a6be7beda7aebec6d23c328995fa7d8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:178-223 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:239-302 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:332-435 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:35-153 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:161-226 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88753994eb70702223e3f1be005666f16b93641facbcc35238bb4dc8f3b013b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:2486-2723 | sdk/go/native/src/lib.rs:2905-2921 | sdk/go/native/src/lib.rs:2939-2960 | sdk/go/native/src/lib.rs:3018-3028 | sdk/go/native/src/restore.rs:196-217 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1c865cd86094269718163b9ff407e552e9bacbbed3dc3ab5bdc1b2428ad38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/filesystem/lib/backends/dualfs/create_ops.rs:387-456 | crates/filesystem/lib/backends/dualfs/create_ops.rs:470-515 | crates/filesystem/lib/backends/dualfs/lookup.rs:580-701 | crates/filesystem/lib/backends/dualfs/lookup.rs:714-781 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefae0f4b8a014b44593c8d3255f4511dcfd9b9858b1c1e2563f9a5d84549a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/filesystem/lib/backends/dualfs/dir_ops.rs:118-129 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:140-150 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:160-218 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:229-310 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe03722425ded3ee51de27e0c53da8c9d814398aee878a1f75f133d2e03e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:247-329 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:829-846 | crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:834-882 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:423-478 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35c12dd2ae63142f770c9f10b3dee5536037b1c9a91329c856268dbd6a8331"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/image/lib/async_gate.rs:67-85 | crates/image/lib/async_gate.rs:88-106 | crates/image/lib/storage_lease.rs:241-259 | crates/image/lib/storage_lease.rs:261-279 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/async_gate.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe5cf692de36adfaddd680662e1df671da44d2c26103484a5335a1b8a3a6bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/image/lib/checkpoint/admitted_disk.rs:139-161 | crates/runtime/lib/checkpoint/layout.rs:446-478 | crates/runtime/lib/checkpoint/local_disk.rs:171-197 | crates/runtime/lib/checkpoint/memory_cache.rs:500-515 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560e1c76f141fa76c5b7fc02e74224c3753ff09a91f6bae5e3192dc4c091005"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/image/lib/checkpoint/admitted_disk.rs:170-184 | crates/runtime/lib/checkpoint/additional_disk.rs:354-368 | crates/runtime/lib/checkpoint/local_disk.rs:206-220 | crates/runtime/lib/checkpoint/memory_cache.rs:534-548 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ab36a1fde2cd4417e4b86da9d0b1b0fbe71d50bffffca2ac0a03a7893ed00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/image/lib/erofs/fsmeta.rs:246-342 | crates/image/lib/erofs/fsmeta.rs:351-422 | crates/image/lib/erofs/fsmeta.rs:428-485 | crates/image/lib/erofs/writer.rs:655-719 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc31deedbac68b405675281de19cbe7ad83a1afb8428907f21cc6c8b491c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:515-529 | packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:531-545 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:626-640 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:718-730 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e80e224a5d3646c18fb1674c6fa8dcccd32d6eb83f9427795c49536fff62b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:4830-4866 | sdk/go/native/src/lib.rs:4876-4911 | sdk/go/native/src/lib.rs:5665-5712 | sdk/go/native/src/lib.rs:5722-5768 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c713ffcb10a60c8da797bd1b3920b37323a8459876ac794e7c4224d4efffa9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:5061-5074 | sdk/go/native/src/lib.rs:5084-5097 | sdk/go/native/src/lib.rs:5161-5171 | sdk/go/native/src/lib.rs:5181-5191 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"177ed2b94abeab1cca091ba29613b76787b06d3d988930bdb0c915cb0abd5d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/go/native/src/lib.rs:5432-5458 | sdk/go/native/src/lib.rs:5593-5620 | sdk/go/native/src/lib.rs:5780-5839 | sdk/go/native/src/lib.rs:7230-7258 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":5432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62bfd6d401e336f6d1c8d636c63349ac1813e987e67c5101d61850a0c6d1b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/node-ts/native/sandbox.rs:662-686 | sdk/node-ts/native/sandbox.rs:697-721 | sdk/node-ts/native/sandbox_handle.rs:272-294 | sdk/node-ts/native/sandbox_handle.rs:305-327 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bcd0a17436a54f0b4edd738a745ffbaf36f07bf3b94fdeb92cb31fb6b4bdf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/python/src/sandbox.rs:603-615 | sdk/python/src/sandbox.rs:639-651 | sdk/python/src/sandbox.rs:797-809 | sdk/python/src/sandbox.rs:835-847 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"190d82132079579d7646962e69bb4f376abdfdbe20492353c030e2a6127291ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sdk/ruby/ext/microsandbox/src/lib.rs:2276-2286 | sdk/ruby/ext/microsandbox/src/lib.rs:2327-2335 | sdk/ruby/ext/microsandbox/src/lib.rs:2377-2385 | sdk/ruby/ext/microsandbox/src/lib.rs:2434-2442 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7492f22aaccb0e4e555a08dd05b06dfc0db4b17b20766cfb9e3f929f65206b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (112 corresponding lines): sdk/rust/lib/backend/local/snapshot/archive.rs:1204-1346 | sdk/rust/lib/backend/local/snapshot/archive.rs:1358-1469 \u2014 These two members are one piece of code written twice and then edited apart: 112 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f98c45e79d7d2b5c1aa63164f8368281d6b7ab4d72d9f639e9c85cc3ecc7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): crates/metrics/lib/compatibility.rs:137-231 | crates/metrics/lib/registry.rs:712-843 \u2014 These two members are one piece of code written twice and then edited apart: 95 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":"crates/metrics/lib/compatibility.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5942b50b9cf2aa329988329073e873cb882e53e305c9a3c6d3024bcad165ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): crates/runtime/lib/checkpoint/disk.rs:293-397 | crates/runtime/lib/checkpoint/owned_disk.rs:360-437 \u2014 These two members are one piece of code written twice and then edited apart: 78 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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb550f7551f5923f716fd4035eb9fdea2b74f05b29f3ddbabd699ee134096b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): sdk/node-ts/native/pull_progress.rs:140-269 | sdk/python/src/sandbox.rs:2578-2693 \u2014 These two members are one piece of code written twice and then edited apart: 116 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":"sdk/node-ts/native/pull_progress.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31707237cd3aa73410310dc5292b28512cf03edd913aa60318e71fad5ebedbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): sdk/rust/lib/backend/local/snapshot/downgrade.rs:755-844 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1339-1408 \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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f991cbc6f8324f83fe2cbf179bcdac3e3f3ebcc5984e8a534aed35260e85aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/cli/lib/commands/copy/host_windows.rs:438-492 | sdk/rust/lib/sandbox/patch.rs:1663-1737 \u2014 These two members are one piece of code written twice and then edited apart: 55 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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3bf0c572d8a2164e577b80d06a9d96569be10837d1110c70839a30850f8530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/cli/lib/tree.rs:120-188 | crates/cli/lib/tree.rs:386-455 \u2014 These two members are one piece of code written twice and then edited apart: 69 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":"crates/cli/lib/tree.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29fcf009c9b29526ee414c73b0e0357d2b73940cc8d4fd8fe63dd9e28202f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/cli/lib/commands/image.rs:420-478 | crates/cli/lib/commands/volume.rs:141-205 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"crates/cli/lib/commands/image.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e0f943b759829b92bef47f7e0b93035244309c91e28c2f5fda38ff0091574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): crates/network/lib/engine/icmp/relay.rs:147-214 | crates/network/lib/engine/icmp/relay.rs:223-295 \u2014 These two members are one piece of code written twice and then edited apart: 68 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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f39f06622175dc2af6fcc0f183e56ac07824b23484cca397417fefeaf0b564f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/filesystem/lib/backends/dualfs/create_ops.rs:267-318 | crates/filesystem/lib/backends/dualfs/create_ops.rs:328-378 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5f57c599a1204a97e11bac5f0594a9197b6e1478059a64d69d028c6228d45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/image/lib/checkpoint/compact.rs:107-169 | crates/image/lib/checkpoint/compact.rs:179-223 \u2014 These two members are one piece of code written twice and then edited apart: 45 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":"crates/image/lib/checkpoint/compact.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161d0a8853f664ff89238ea8a0e4cf490bf4906e1961d4a36e8c24e139f65dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/network/lib/engine/netstack/poll.rs:1018-1068 | crates/network/lib/engine/netstack/poll.rs:1074-1130 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b049e5d89b88d675856b04e4a2ac4953be9a47ff96582fc2071dd06bbd97dc29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): sdk/go/native/src/lib.rs:7726-7767 | sdk/go/native/src/lib.rs:7777-7816 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7726}}}],"partialFingerprints":{"codehealthFindingId/v1":"95675dcf70b83f4f0de17fbfa94e90743f8a86ca986f9727b282476cea09a06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/network/lib/engine/icmp/relay.rs:349-402 | crates/network/lib/engine/icmp/relay.rs:405-455 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d596ad684b2a5a0dda2f7d58beefda91348e4d4ebe1fcaa88fd7bf9885e133c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): sdk/rust/lib/backend/local/snapshot/restore.rs:169-209 | sdk/rust/lib/backend/local/snapshot/restore.rs:415-468 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"sdk/rust/lib/backend/local/snapshot/restore.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cc9fe64e15beb89b9d27a179774bbe6554f72a1051458d7e50b66c888ac87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/agentd/lib/config.rs:1060-1100 | crates/agentd/lib/config.rs:1103-1143 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"crates/agentd/lib/config.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"59242055e6d7912b02728b19fbbb96c64eeb7cfe6c67bd095062a1dd251d715d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): packages/microsandbox-types/rust/lib/compat/cloud.rs:277-308 | packages/microsandbox-types/rust/lib/compat/v0_5_0/local/secrets.rs:98-127 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"packages/microsandbox-types/rust/lib/compat/cloud.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be5e0304096467e2ebf10b33fa3bf2721eec3615b45f543825d677b2a3ccc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/image/lib/cache/lock.rs:61-110 | crates/image/lib/storage_lease.rs:683-719 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"crates/image/lib/cache/lock.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5033a0af341eebb8a3d7d000a76b0c99d447e2f0de6f765ec124cda5956a349c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/filesystem/lib/backends/dualfs/xattr_ops.rs:63-98 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:101-136 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"crates/filesystem/lib/backends/dualfs/xattr_ops.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a9c82d81e8714ac1b421b59dc2f9c9c232ff3f625320f6ce4ac45972f68038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): sdk/rust/lib/backend/local/snapshot/metadata.rs:95-133 | sdk/rust/lib/backend/local/snapshot/metadata.rs:138-174 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"77762cba59b632a28804e6babac0f89e229d20f394f48de2b86ddc0264b7cf65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/filesystem/lib/backends/memfs/remove_ops.rs:23-71 | crates/filesystem/lib/backends/memfs/remove_ops.rs:74-132 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291b9e84da43f8b176fe755c1e4e10a32c0b993199dc2b4fc10507dcce5041b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/image/lib/registry/client.rs:1665-1716 | crates/image/lib/registry/client.rs:1829-1870 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"crates/image/lib/registry/client.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3712cecfc2b4ddd8d39400ab6ec7a5948bdcd0048c900aa1d79195e886b120"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/network/lib/engine/udp/fragments.rs:333-385 | crates/network/lib/engine/udp/fragments.rs:439-490 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110d5b897bee0cd9f2bd116c9a5c57a297e678dad200d6022c29f636339102e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/agentd/lib/agent.rs:1587-1649 | crates/runtime/lib/runner/relay.rs:3501-3556 \u2014 These two members are one piece of code written twice and then edited apart: 56 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17c10a9bd6f7be673ff16d6e77566ffd72e870c980e840b0ee4524b24c4a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/network/lib/engine/icmp/relay.rs:490-539 | crates/network/lib/engine/icmp/relay.rs:552-597 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2cba1369b797c9740097236da488ae1201412e3e9c0cfd9c5c720a0aac9480"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/agentd/lib/session.rs:1687-1725 | crates/agentd/lib/session.rs:1727-1763 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"crates/agentd/lib/session.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f5c280d3d3f8a2096f9e76ae1f9689eabdbc349c0ad336c5b5b6e0ec438f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/agentd/lib/network.rs:393-434 | crates/agentd/lib/network.rs:437-475 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"crates/agentd/lib/network.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf234a487806d1d6f1f494f9b066961af2386bd829cc595e9b29cd7bc98295a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/network/lib/engine/udp/relay.rs:787-830 | crates/network/lib/engine/udp/relay.rs:897-943 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624bf725e4229ecc77ffe860bc4932a56c9ebd38a08cf73f6f8cc6c9d883c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/image/lib/cache/store.rs:657-690 | crates/image/lib/cache/store.rs:722-766 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"crates/image/lib/cache/store.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c276f48c8c143b44bfceb690590168ef7606f5e90d1058291836efd5c8099fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/filesystem/lib/backends/memfs/metadata.rs:133-178 | crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:290-332 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d636aa59817b5fcaf5e14191545e9a8f7f5b7ba3e2c76edf91caadbfe2baf964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:42-94 | crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:289-325 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3292fe8001146676026477254ea9f6a5c5b77b828be1ce3e97547859cf8eae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/cli/lib/commands/copy.rs:188-229 | crates/cli/lib/commands/copy.rs:238-279 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c33d6fc08eb37f03c56f2354b7aded9ecf1b10bfb8781326d2987902dca4a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): sdk/python/src/sandbox.rs:1041-1071 | sdk/python/src/sandbox_handle.rs:254-286 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bbbe38958b5c1f65acca79836d68cda31cfc5e51ac3d20cb1cda13c409f64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/network/lib/engine/udp/relay.rs:843-886 | crates/network/lib/engine/udp/relay.rs:956-1000 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"af610f2cd8ccba14628bb734b0b00d3ee85fc69596e30c01fd8c24ea9194255a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/migration/lib/m20260305_000004_create_sandbox_images_table.rs:50-101 | crates/migration/lib/m20260808_000001_create_memory_allocation_nodes.rs:39-97 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"crates/migration/lib/m20260305_000004_create_sandbox_images_table.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6249f2679ca6e9a9da4a42b330f2f39e492acf6dba78d2e61ec33676d0995ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/network/lib/engine/ports/publisher.rs:1313-1352 | crates/network/lib/engine/tcp/connection.rs:621-660 \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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bff9fa4c27889bbb45e861f2f432f741a9cc9267d4b3a6e7db295b5ab9128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:36-72 | crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:74-110 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a060c910eb0b7375dcce464a8ce29b9c8b59667155226965684e7243be869dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/network/lib/engine/icmp/relay.rs:602-629 | crates/network/lib/engine/icmp/relay.rs:639-676 \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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7428800de115009916601c7d57157d7935d575d30749e2c755105c3c98f943"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:312-330 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:393-409 \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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a419369cb0e5590d27d69c0d9630226334ea97e26e76ced595fe28d6e7f0d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/cli/lib/commands/install.rs:299-326 | crates/cli/lib/commands/install.rs:338-371 | crates/cli/lib/commands/install.rs:380-419 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"crates/cli/lib/commands/install.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8a4f2d024b6a35edf32157d75bcf1cf69c5833553eb80b5fa07e68e9586b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/runtime/lib/client/ipc.rs:778-816 | crates/runtime/lib/client/ipc.rs:819-847 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c72a1f64d92c03ec59f8a47d5628f2cfd7360738bb8b4f7e0ec47e8208cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): sdk/rust/lib/image/mod.rs:629-660 | sdk/rust/lib/image/mod.rs:717-752 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"sdk/rust/lib/image/mod.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3139474496f12e03d0d614cf900da88712f6da11a07175cfbbb30bffba03e918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/image/lib/cache/store.rs:168-206 | crates/image/lib/cache/store.rs:209-249 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"crates/image/lib/cache/store.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c95e4fb4b5bb27ffe45ace2111e5201c238725b36528adaed0ee807b2f0bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): crates/agentd/lib/config.rs:805-836 | crates/agentd/lib/config.rs:847-890 | crates/agentd/lib/config.rs:901-940 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 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":"crates/agentd/lib/config.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"39350134fb9f96270119f34bf5f9d2987ed89225bf85bf855eb4054e29a7d696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/network/lib/engine/tcp/proxy.rs:819-862 | crates/network/lib/engine/tls/proxy.rs:423-469 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2536472942476bfcb9d3c9a63826fc067296e0b3c84be99e690e4312e5c9f328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): sdk/python/src/volume.rs:207-231 | sdk/python/src/volume.rs:250-273 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"sdk/python/src/volume.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1157afd7bec6d8387730a03a3f587b45475b6e92a6d3fac61130eb4e20f1a737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/cli/lib/commands/copy/host_windows.rs:189-230 | crates/cli/lib/commands/copy/host_windows.rs:251-295 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0959006e55ec5d1614e71b32d9627e12e383c8a66e81bd5e4059306796f6672c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/network/lib/engine/udp/fragments.rs:388-410 | crates/network/lib/engine/udp/fragments.rs:493-515 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95a2edd2b40f3e5dfee57bdd316f824e4b770b216b35f64756d307ca7f5ab86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): sdk/go/native/src/lib.rs:7419-7443 | sdk/go/native/src/lib.rs:7451-7475 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd2c5a49c33290ea3898ad85e72fd3b89e4bafba6e6532401634396fae762f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): sdk/go/native/src/lib.rs:4280-4314 | sdk/go/native/src/lib.rs:4323-4360 | sdk/go/native/src/lib.rs:4465-4495 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38dab11ac70df5ce6dc6e0bdfa30582a2d8a79d8ff7f4b016bc2dae10a520fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): sdk/go/native/src/lib.rs:7488-7513 | sdk/go/native/src/lib.rs:7524-7549 | sdk/go/native/src/lib.rs:7561-7598 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e7658b7bc0634aabe64115b96693f0f01b3a9005a770880fbe497d55984a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/image/lib/checkpoint/store.rs:477-511 | sdk/rust/lib/runtime/launch_contract.rs:593-618 \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":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc16e00b239ec29316c512e693c8eaf57530089bfe7f39dc53df19661caff6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/network/lib/engine/udp/fragments.rs:717-747 | crates/network/lib/engine/udp/relay.rs:1063-1094 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"840632540c064db811b9f12ada73bae6b1ae7c3c15821b28b4f2c5c21184aa4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/protocol/lib/codec.rs:100-134 | crates/protocol/lib/codec.rs:379-409 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"crates/protocol/lib/codec.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fcf474dce1514e1b94f09b1000de54dd48db738618848151670fe489eae128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/runtime/lib/runner/cpu/allocation.rs:427-461 | crates/runtime/lib/runner/writeback/admission.rs:699-741 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faa908417587ec615c9a2ff3027cad0e080d31570c3fed148b53795d56c3153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/network/lib/engine/udp/fragments.rs:599-627 | crates/network/lib/engine/udp/fragments.rs:630-659 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f43e30e9972fafb52197ef28d9bd0264c0ff1c4f765aa5b20f883438d0e7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/image/lib/erofs/reader.rs:421-447 | crates/image/lib/erofs/reader.rs:459-486 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"crates/image/lib/erofs/reader.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2513306a91d1d2a886cb9d798d9f3ccb2c2013237ca0af28e86dbd91df692606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/network/lib/model/policy/types.rs:515-551 | crates/network/lib/model/policy/types.rs:565-596 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"crates/network/lib/model/policy/types.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5aa323a2f28b5dffaed13bbea757f3fdc5773c7989567defd050c00b5744d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 31\u002B corresponding lines): crates/cli/lib/commands/copy.rs:366-406 | crates/cli/lib/commands/copy.rs:416-452 | crates/cli/lib/commands/copy.rs:541-571 | crates/cli/lib/commands/copy.rs:580-617 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 31 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ee1e0f14d7dfedd99db09897e77968eca5b45d72d3aad950df14c7287f5789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/runtime/lib/client/ipc.rs:104-133 | crates/runtime/lib/client/ipc.rs:480-511 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f915dc35777f80bf1e8bb3f2feb31b3c2a62a3bfba8817a1d721acc19cb46a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): sdk/go/native/src/lib.rs:6930-6959 | sdk/go/native/src/lib.rs:6970-6993 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6930}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca40039fafa38f52f8cca9a5b8e412c9e676b0f5719197a0081e599013a5bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): sdk/node-ts/native/runtime_config.rs:129-154 | sdk/python/src/lib.rs:238-264 \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":"sdk/node-ts/native/runtime_config.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed430bd682aea884ff24cd44e6068cf7f2b87eab90c4acef55771891e65760b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/migration/lib/m20260305_000001_create_image_tables.rs:323-343 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:410-430 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"504354d4e4f74168af677954d1d3878e1a0ef069896ee3add81943388ae2cf95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/network/lib/engine/udp/fragments.rs:187-219 | crates/network/lib/engine/udp/fragments.rs:257-289 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"583a72ba305c4c3695f96248771f415fccc7d7d525d6db2b83b2a63b00982e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): sdk/rust/lib/backend/local/snapshot/archive.rs:4393-4426 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1519-1548 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":4393}}}],"partialFingerprints":{"codehealthFindingId/v1":"742df4fb14cb10779616992d3e97b5b7e80d3c593890c59bba58d5ed09b6f9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): sdk/go/native/src/lib.rs:5980-5998 | sdk/go/native/src/lib.rs:6048-6070 | sdk/go/native/src/lib.rs:7826-7844 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcc9f9a0de56fe546e6bc8e064546844928d4b7688f5513707bc5ed664d9e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): sdk/python/src/snapshot.rs:96-124 | sdk/python/src/snapshot.rs:154-182 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"sdk/python/src/snapshot.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4d78bd4c6f16ecea23b7f6d1c59959f1e3200461bf1aa21f8cfaef4f80039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/filesystem/lib/backends/dualfs/materialize.rs:589-615 | crates/filesystem/lib/backends/dualfs/materialize.rs:625-659 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"crates/filesystem/lib/backends/dualfs/materialize.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca957e5acfe80f882eb3b48e68c9821178d9815bdfbc0a5752bf19fdf234c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/runtime/lib/client/maintenance.rs:614-641 | crates/runtime/lib/client/maintenance.rs:647-666 \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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f3ef701a5da59fedf7e3e8dbef4bf262e93ea5ddcdeab275b4505cb471ed60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): sdk/python/src/ssh.rs:77-101 | sdk/python/src/ssh.rs:120-150 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"sdk/python/src/ssh.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ddc5b6f908a62fed4e11293debc415537caaf2c1e29d86bf5c1d55a97151b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs:77-100 | crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:120-154 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72c61df30ce9be79517f1907a0aa05a1800054b0c96f98e4de5639b3eb16027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:58-75 | crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:86-100 \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":"crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"72497ac2e05e6fabe4889d802b2deeed044363fb66f95634a245c00570c0eee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/rust/lib/backend/local/snapshot/metadata.rs:72-90 | sdk/rust/lib/backend/local/snapshot/metadata.rs:180-198 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3cddb4b92ff6aa3bc811c860d824d9cca22458f0bec451859a8c6f70563343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/cli/lib/commands/remove.rs:40-77 | crates/cli/lib/commands/stop.rs:45-76 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"crates/cli/lib/commands/remove.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae461dddc46a21d3531713d0979e62597f3de3d285b095a537e8aff8e0db09af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/runtime/lib/runner/cpu/allocation.rs:184-201 | crates/runtime/lib/runner/writeback/admission.rs:116-138 \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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"495650b294bf393c3200e3dd7b9d13950b1ed1caf95807d0508f4c01cc730111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/special.rs:32-61 | crates/filesystem/lib/backends/passthroughfs/unix/special.rs:201-225 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"crates/filesystem/lib/backends/passthroughfs/unix/special.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec56e5465425314bc7d16445d4b580f77892c6b144b471c1964c359bddf9e60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/rust/lib/backend/local/snapshot/downgrade.rs:1107-1125 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1130-1148 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b246be0ef8888391a79112f6f0c47149903e22aec6dec3458f611c06a60984d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/image/lib/checkpoint/resolver.rs:367-387 | crates/image/lib/checkpoint/store.rs:194-214 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3905b3581a4de0448f017dfd4f7061e32e4a433714db91a3e0a56b3876ee10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:2639-2654 | sdk/ruby/ext/microsandbox/src/lib.rs:2656-2674 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb14c8f16e13bf682a9e576e2c495308f6597b610ef32da143ea7a14874d010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/rust/lib/runtime/spawn.rs:1454-1474 | sdk/rust/lib/runtime/spawn.rs:1480-1498 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6ecc8f2ea87f92f765cc8eddffff9d1daa24f50de08263fa1ad8a7d1cd71d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/image/lib/tree/model.rs:424-445 | crates/image/lib/tree/model.rs:447-468 | crates/image/lib/tree/model.rs:470-491 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"crates/image/lib/tree/model.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef732aa96aca5cfcf24a76cd06354dea9d9ab236023388ff9bf986613fed7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/utils/lib/process_lock.rs:136-167 | crates/utils/lib/process_lock.rs:244-276 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"crates/utils/lib/process_lock.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec36f69294c694e8eeeae24cd0687de116d6033a4bfac3e62ca8eab9e212cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/agentd/lib/workload.rs:129-162 | crates/agentd/lib/workload.rs:181-214 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"crates/agentd/lib/workload.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59ffd29522e2fab8ce5300e9632dae59c0b2b1a5dd6703f22b9cab716044db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/go/native/src/lib.rs:4686-4702 | sdk/go/native/src/lib.rs:4762-4778 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4686}}}],"partialFingerprints":{"codehealthFindingId/v1":"13449263b6194c648849fe99495f1fbaab7c73203b6f8c6bb91dec554b641218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/rust/lib/backend/local/snapshot/downgrade.rs:452-478 | sdk/rust/lib/backend/local/snapshot/migration.rs:101-117 \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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2460d978ddd7134de122856a5673a5ac5698c2899576ba142f27646d329813ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/cli/lib/commands/self_cmd.rs:1979-2026 | crates/cli/lib/commands/self_cmd.rs:2112-2160 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"313d915ea645f51f35a49b929384b35cc3f89616e625c88a4570fa736e156e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/network/lib/engine/icmp/relay.rs:459-477 | sdk/rust/lib/runtime/spawn.rs:1570-1585 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c667469197138136381fd8de86854acb001e8f916ce7ae5a44e1561b49a0c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/image/lib/archive/docker.rs:1226-1250 | crates/image/lib/archive/docker.rs:1255-1282 | crates/image/lib/archive/docker.rs:1284-1314 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa50efcfc860a3ca2d17b067d198123557cf367224d67c6db24f4ad8b2258e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/image/lib/archive/docker.rs:1803-1822 | crates/image/lib/archive/docker.rs:1829-1845 \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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3ff996b75fe82d6cdbe9472c048bb0b8991ecdc196f7ee207502dfa426bbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/metrics-collector/lib/core/label_cache.rs:91-109 | crates/migration/lib/m20260810_000001_rebuild_sandbox_labels.rs:98-119 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"crates/metrics-collector/lib/core/label_cache.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"821f8d9f11cd5a5d0ec4cfa0a9c20344effa418fcdf605f3e9fb5ead7416e2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): sdk/go/native/src/lib.rs:7605-7621 | sdk/go/native/src/lib.rs:7631-7648 | sdk/go/native/src/lib.rs:7666-7683 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb97ec323a6447a8d41e50aee5c5d035470b8d06c724f34f60fd2ec4ca32b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:713-725 | sdk/ruby/ext/microsandbox/src/lib.rs:727-738 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f387f730d80efc494f376dc23e0baad8f5682565e01f955e9cb456c674c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/rust/lib/runtime/handle.rs:463-479 | sdk/rust/lib/runtime/handle.rs:611-627 \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":"sdk/rust/lib/runtime/handle.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf6b14005fb7217c2666d9eb294036ce0212e2cb0f87cd43cd67083ebcb4e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/image/lib/cache/store.rs:1017-1035 | crates/image/lib/layer/download.rs:305-323 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"crates/image/lib/cache/store.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e226a426562617852880c9ce00b73769d5c1537139df01df5c70c8e0ecdc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/agentd/lib/workload.rs:287-312 | sdk/rust/lib/runtime/handle.rs:582-608 \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":"crates/agentd/lib/workload.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b2d6818a432699315731c1d275bb9c0bbb8450c7c81d9f01a5b75a36625310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/network/lib/engine/icmp/relay.rs:683-707 | crates/network/lib/engine/icmp/relay.rs:710-733 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c812893e2c72e28347791f611f89bb77f85c06aeda93398890d35999181a3345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/agentd/lib/config.rs:1164-1180 | crates/agentd/lib/config.rs:1183-1199 \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":"crates/agentd/lib/config.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b34866476208c5d7f3fd100f5eb127429bd29c26a8a529d4f834e89608822f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): sdk/python/src/sandbox.rs:1265-1282 | sdk/python/src/sandbox.rs:1293-1308 | sdk/python/src/sandbox_handle.rs:512-528 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d050b25844441a287482e991f326c54b57548cd9b96659dd5f963fe87d98e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1731-1746 | sdk/ruby/ext/microsandbox/src/lib.rs:1752-1767 | sdk/ruby/ext/microsandbox/src/lib.rs:2259-2274 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b30e901d2ead22cb903b1be9e56481684b97f17adbf11ff928587d6af1cc65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): crates/cli/lib/commands/image.rs:714-745 | crates/cli/lib/commands/snapshot.rs:567-590 | crates/cli/lib/commands/start.rs:36-67 | crates/cli/lib/commands/volume.rs:260-289 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab95a498d3415c6efffd26a58040c78c017028e6956747855c4fcef6eba7abd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): sdk/python/src/sandbox.rs:1848-1867 | sdk/python/src/sandbox.rs:1933-1954 \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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a7e5dcb0f427850f4d13beab5d5d36f790f8aa808c6af3ecb60fbc7f588f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/node-ts/native/jobs.rs:164-180 | sdk/ruby/ext/microsandbox/src/jobs.rs:213-229 \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":"sdk/node-ts/native/jobs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"65938b136e1dd6e993d8ee44b1008b90a70c70f7b4b446aaf35def4abb5222c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/protocol/lib/codec.rs:71-92 | crates/protocol/lib/codec.rs:184-205 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"crates/protocol/lib/codec.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f1d3e99f837c3f432a968906594102f33764cd5806ce3265f0f8f32975b209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): packages/protocol-client/rust/lib/client.rs:68-82 | packages/protocol-client/rust/lib/client.rs:93-106 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"packages/protocol-client/rust/lib/client.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efdb56f2eeb2f38084614f16fef347dc15337ccd884731beebad066d5a26eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/go/native/src/lib.rs:7002-7018 | sdk/go/native/src/lib.rs:7029-7046 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7002}}}],"partialFingerprints":{"codehealthFindingId/v1":"743dc7cc5fc14378c38591abfc09a1e4ad6cff5aaa9db284c6e73f55ffe37d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/node-ts/native/ssh.rs:243-261 | sdk/node-ts/native/ssh.rs:266-287 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/node-ts/native/ssh.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"225b72107e3b3d6bc2734e3a8ab2612f142d5325e1068a1c1eb03593518071f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): sdk/node-ts/native/network_builder.rs:51-61 | sdk/node-ts/native/network_builder.rs:80-90 | sdk/node-ts/native/sandbox_builder.rs:571-581 | sdk/node-ts/native/sandbox_builder.rs:600-610 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c930c14bed4027d92934ecde580ad9b2e02f25e63b8cf5cb79251fde2b207ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/image/lib/ext4/formatter.rs:1539-1556 | crates/image/lib/ext4/formatter.rs:1562-1578 \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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9bf74fc6c4be5d52df7c8e85087be611024639478e7c4d24be220cf2297bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/go/native/src/lib.rs:5006-5026 | sdk/go/native/src/lib.rs:5035-5051 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5006}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7fedad7ad101c2fa00c7c300bb1c9cc92819306ca3c18640aa513fdaea7a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): sdk/python/src/jobs.rs:158-177 | sdk/python/src/jobs.rs:189-208 \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":"sdk/python/src/jobs.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b1196be70e3ea85773bb72362ae05c55414d02867ee382d435d349aada11e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/cli/lib/commands/ping.rs:42-63 | crates/cli/lib/commands/restart.rs:54-75 | crates/cli/lib/commands/touch.rs:36-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"crates/cli/lib/commands/ping.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54a78ba9a84a08ec654e0f3a3fdb15839b1ba404a348817445fa5e885331c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): packages/microsandbox-types/rust/lib/snapshot/guest_clock.rs:32-52 | packages/microsandbox-types/rust/lib/snapshot/restore_defaults.rs:36-56 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"packages/microsandbox-types/rust/lib/snapshot/guest_clock.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82a766c8b80739ae3187caf16f0625c41bf089e530e17d4df818816653173ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sdk/python/src/sandbox.rs:369-384 | sdk/python/src/sandbox.rs:435-456 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2a7e820d7a2f1a77f9fb8bbbc8ac2cc2ea8cc9701ebb7e2a0e39a7e7f1a700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/agentd/lib/network.rs:250-269 | crates/agentd/lib/network.rs:272-289 \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":"crates/agentd/lib/network.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e2e5fe6956b683acb187cb221fd6be6490ad59ae4c893f8a39ff531420d6b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/node-ts/native/jobs.rs:107-125 | sdk/python/src/jobs.rs:96-116 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/node-ts/native/jobs.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e319b88cd02e0cfefb7843d2944a5a6a15dd081c942a5f8fff903622f2345d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): sdk/rust/lib/runtime/launch_contract.rs:753-776 | sdk/rust/lib/runtime/launch_contract.rs:858-880 | sdk/rust/lib/runtime/launch_contract.rs:887-907 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"c478109501b3d375af73c9d949ef8295694feaaf36b0dcc36df3e4dcfd5bc200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sdk/go/logs.go:67-84 | sdk/go/logs.go:112-133 \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":"sdk/go/logs.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f873440711df56f2fa34e4bc151d4a587d183473a474b35e70c49565e0200754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/go/native/src/lib.rs:1736-1750 | sdk/python/src/helpers.rs:1940-1960 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"949ec9a757ffa5840bed100180f2607b28577c3a245380c51d795570e6b58819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/cli/lib/commands/common.rs:2061-2080 | crates/cli/lib/commands/common.rs:2086-2105 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac4103beae5b7ba299ded173e095d7e84986f63a58509262b66e4cb7f6b18da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/network/lib/engine/udp/relay.rs:720-742 | crates/network/lib/engine/udp/relay.rs:752-776 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed46578217975db09e01c31532e112bbece95db51d62db2d8f1951ca82e8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): packages/microsandbox-types/rust/lib/cloud/secrets.rs:199-215 | packages/microsandbox-types/rust/lib/cloud/secrets.rs:219-235 \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":"packages/microsandbox-types/rust/lib/cloud/secrets.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a1d2f01e3194799b2c6b61e6dfd3ebf004932014cefae9fa4ab3794cd4d270"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sdk/rust/lib/backend/local/snapshot/artifact.rs:67-87 | sdk/rust/lib/snapshot/api.rs:712-733 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"sdk/rust/lib/backend/local/snapshot/artifact.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"96834a486a5b74fa01dc9c649c1f2a01a5ef467e7a89a5c9e90919ead0346019"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): sdk/go/exec.go:53-71 | sdk/go/exec.go:77-97 | sdk/go/exec.go:267-281 | sdk/go/exec.go:284-298 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/exec.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f052feb4f405cbe0f150f8a481fc13cdf2638877b8eecb5a7705dcc445252d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/cli/lib/machine_cmd.rs:419-441 | crates/runtime/lib/client/compat/launch.rs:271-288 \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":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4b731489a90bd020f134fba509503f27ffc15420fab23ee350b712f50f203a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/go/native/src/lib.rs:6109-6126 | sdk/go/native/src/lib.rs:6315-6329 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9d74d86fce7290ddd161feb05a25fc2cf30fedb290dc84ea30601730513bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sdk/node-ts/native/sandbox.rs:1355-1372 | sdk/python/src/sandbox.rs:1823-1842 \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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"16779523c9fede6f97b2501477dd9291da0677c659757f127657ebaf399b820b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/go/native/src/lib.rs:6294-6308 | sdk/go/native/src/lib.rs:6394-6408 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6294}}}],"partialFingerprints":{"codehealthFindingId/v1":"907cf909d63b07ac795ab40372d310ce7a07fdbc375e4fae57a4d1c1911ca420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): sdk/python/src/sandbox.rs:679-691 | sdk/python/src/sandbox.rs:719-731 | sdk/python/src/sandbox.rs:759-771 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1895970ae4f15427e8221ec63ef8e941ddf746f351b10a8f46b0e05f8b2134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/python/src/volume.rs:176-186 | sdk/python/src/volume.rs:285-296 \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":"sdk/python/src/volume.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d2251f17469f60277db76fa0cb817623aab84d76d1cb8aeed4241dd7233ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sdk/rust/lib/backend/cloud/http.rs:173-194 | sdk/rust/lib/backend/cloud/http.rs:200-217 \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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5034de8107a9e6288ab39a66bf0b80112635af927ca15f02850c787e8ab3b7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/python/src/sandbox.rs:1089-1100 | sdk/python/src/sandbox_handle.rs:300-311 \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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f39b7c316fdc639963061b1aed675f8a1d38d4270690ff4d8e400f3e748dec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/cli/lib/commands/self_cmd.rs:1935-1950 | crates/cli/lib/commands/self_cmd.rs:1956-1976 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01416ffff675ac2281585860db0a7ca58a28da3549b141c957a786ec73ff9d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/node-ts/native/image.rs:247-258 | sdk/python/src/image.rs:328-339 \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":"sdk/node-ts/native/image.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3517be5c91570e855f4b49d0ee59e6011ce5d4bddf613136ec743c67422e9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/python/src/sandbox.rs:262-276 | sdk/python/src/sandbox_handle.rs:54-68 \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":"sdk/python/src/sandbox.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b8c037f7ce42f0b3ff4c88e4e9a9e36bcdcb4d912030c0e75f40d9af5a0642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sdk/go/ssh.go:58-78 | sdk/go/ssh.go:269-290 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"sdk/go/ssh.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3deed56e23e38bce42748d9df182a3a1e5494492b0c4e037de50fb58df5dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/db/lib/private_storage/macos_acl.rs:119-131 | crates/db/lib/private_storage/macos_acl.rs:133-143 \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":"crates/db/lib/private_storage/macos_acl.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c571a67359e1a26e330ed317f34f4d906c238a80d59a558193c6fb98b29c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:351-366 | crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:373-390 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cc158ed33de65f8df20520e6ad293b6da5533a8874a68af00cf93b4685cf70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/migration/lib/m20260824_000001_mount_owner_config.rs:35-60 | crates/migration/lib/m20261001_000001_guest_clock_config.rs:34-54 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"crates/migration/lib/m20260824_000001_mount_owner_config.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8afa4d7bf6e16b454fb9d19d9ec7cdd7b8e536d4346f7f506f40555fa6fccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/runtime/lib/runner/relay.rs:1265-1289 | crates/runtime/lib/runner/relay.rs:1300-1321 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb2c76455efe2b16095fce1359575a1d292c1be20353f56849b4ce52b3b8ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/utils/lib/process_lock.rs:109-133 | crates/utils/lib/process_lock.rs:207-228 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"crates/utils/lib/process_lock.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc2a7e328266a06f2877a145021eb3cbc3d80cc97894e1bfe844de96961fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): packages/microsandbox-types/rust/lib/validation.rs:20-48 | sdk/rust/lib/volume/mod.rs:956-979 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"packages/microsandbox-types/rust/lib/validation.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fd78929f9629e77563059160f781a9f3a6596c344bcc090cdbdd3a3503e4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/cli/lib/commands/metrics.rs:424-446 | sdk/go/native/src/lib.rs:4918-4935 \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":"crates/cli/lib/commands/metrics.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc51bc821459e5de7c08f879cbc22aff8a44deb53fb9f6c7b976ce5d037b9b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/filesystem/lib/backends/shared/platform.rs:437-451 | crates/filesystem/lib/backends/shared/platform.rs:676-690 \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":"crates/filesystem/lib/backends/shared/platform.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada916d22d55323280a0d6ccca1bebf5427e6598ce7055d2b27195e920776db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/runtime/lib/client/ipc.rs:729-748 | crates/runtime/lib/client/ipc.rs:751-766 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e75179757681ebf3c94b734b06d22cb58224536fe3782424a3c3f249af1ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): packages/microsandbox-types/rust/lib/secret_plan/input.rs:212-226 | packages/microsandbox-types/rust/lib/secret_plan/input.rs:231-246 \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":"packages/microsandbox-types/rust/lib/secret_plan/input.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e7547bcd79e538457996cd133156fb5869e0e589e17823ae5e4fb2f8be322c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sdk/node-ts/native/sandbox.rs:224-241 | sdk/python/src/sandbox.rs:494-513 \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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb52661521a6b555f3e17bd12d2383b0544a90183386d15b819aa2e5cd04ed15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1363-1373 | sdk/ruby/ext/microsandbox/src/lib.rs:1386-1396 | sdk/ruby/ext/microsandbox/src/lib.rs:1769-1779 | sdk/ruby/ext/microsandbox/src/lib.rs:1791-1801 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"38864b2661aa0ccdafcd5eeb16108dfa59dd32464dd74e1367e475847eb88d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:2337-2348 | sdk/ruby/ext/microsandbox/src/lib.rs:2387-2398 | sdk/ruby/ext/microsandbox/src/lib.rs:2444-2455 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f79d44428b9e84767feea634091f82c9b7505108a4803de6d4ca39221be165"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/filesystem/lib/backends/memfs/dir_ops.rs:34-49 | crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:34-48 \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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97295d12f35d37c83dfa6f86d016631db86000fd27208c9bbaa2ca69b1b2084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/rust/lib/logs/mod.rs:301-317 | sdk/rust/lib/logs/mod.rs:329-345 \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":"sdk/rust/lib/logs/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af868fdcda2872a5a2ea951f8c4f2e71eafc8e2c9a296d5232070879fe8744b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/cli/lib/commands/common.rs:2894-2908 | sdk/node-ts/native/network_builder.rs:475-489 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f88edd58a2ef1e8efe75e188abc1dfcf417e35b81f47439f0b5359662cbaf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/go/native/src/lib.rs:3785-3797 | sdk/go/native/src/lib.rs:3879-3891 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3785}}}],"partialFingerprints":{"codehealthFindingId/v1":"03402d42cc3a3d8bee1995220027d764840ede3e351f08005fbc007413788d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/node-ts/native/sandbox.rs:1059-1073 | sdk/python/src/logs.rs:121-135 \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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1356041f128b597452249616dd45cdedcdedbf960e8fd38792465467db0240e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/filesystem/lib/backends/memfs/inode.rs:114-134 | crates/filesystem/lib/backends/memfs/inode.rs:137-153 \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":"crates/filesystem/lib/backends/memfs/inode.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c30697744e4af96e9611db1dece93e2ad042b2141a00509527677b1878f6c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/network/lib/engine/network.rs:738-750 | crates/network/lib/engine/network.rs:766-778 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/network/lib/engine/network.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"351e4fda4a2ed5f91c316a4526ecb281d0074ea29cb26abdd64b50c05319aa27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:2233-2244 | sdk/ruby/ext/microsandbox/src/lib.rs:2246-2257 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a7e692c625ed002f2bc6f8b9f6c4014696c07ad9e56046003a690adc54f119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/runtime/lib/runner/jobs.rs:1076-1088 | crates/runtime/lib/runner/jobs.rs:1090-1102 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924bde79ee9e1797a919d1aff6d4471f14cb7c39be3d3d79c8c53d35922b754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/node-ts/native/restore_builder.rs:236-252 | sdk/node-ts/native/sandbox_builder.rs:234-250 \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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9cb1b7cbddb7a8a8cb349a7feb8062c5075b49f5ce5f2e9304ed92c854865b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): sdk/rust/lib/agent/client.rs:153-174 | sdk/rust/lib/backend/local/mod.rs:555-577 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"sdk/rust/lib/agent/client.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"071815ea82f1d85a46cfc9b8adcb8bd5693708abdc3ce315f7cce0a29ebc94a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:1100-1112 | sdk/rust/lib/backend/local/snapshot/migration.rs:1185-1201 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/filesystem/lib/backends/passthroughfs/unix/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ce523d68f7cf227ce08f08a9ca174750fe8144e50478838c7da92fe9ef00e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/metrics/lib/registry.rs:596-618 | crates/metrics/lib/registry.rs:621-638 \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":"crates/metrics/lib/registry.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c26705398ec7691f59e7b11d5c03d33aa9a89ea9cab22eb793eccc25f6f8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/runtime/lib/checkpoint/disk.rs:611-628 | crates/runtime/lib/checkpoint/owned_disk.rs:453-469 \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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88749988912421eb4ae04d18f157cd0aa81063c324c7e1e4ce9c5eb04a62e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/python/src/sandbox.rs:877-889 | sdk/python/src/sandbox.rs:913-925 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24d505a7bb0565c98bc3f276b67610f7ac51f42c411e2d426ed1a987af3d392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/metrics/lib/compatibility.rs:283-291 | crates/metrics/lib/registry.rs:1436-1443 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics/lib/compatibility.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bacac55784f9a6ea947c44bc162fc8138bf8e009a2f8239132cf8a7d41410f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/agent-client/rust/lib/optimized.rs:610-619 | packages/agent-client/rust/lib/optimized.rs:626-635 \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"40990ed5440d37d4cffe7beecf32da1ee8f41ca3cbcc67ce03304eba1f98e48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sdk/python/src/metrics.rs:104-122 | sdk/rust/lib/sandbox/metrics.rs:386-404 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"sdk/python/src/metrics.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd008a6946821ffe866c77784d7dacfaf50e42a347610ea26ae92407097613f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/python/src/sandbox.rs:1316-1330 | sdk/python/src/sandbox_handle.rs:536-550 \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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6691ba356dc87308271029ae810f5f4c55920b0ce6f0cd81fe109bbddc5e567c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): sdk/python/src/sandbox.rs:1435-1450 | sdk/python/src/sandbox.rs:1462-1476 | sdk/python/src/sandbox_handle.rs:631-646 | sdk/python/src/sandbox_handle.rs:657-671 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d63f8a05c30e40a437fc213432f0749abaf03a3f0cea5d250dd5a2fb193e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/runtime/lib/checkpoint/cache_storage.rs:486-502 | crates/runtime/lib/checkpoint/memory_cache.rs:517-531 \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":"crates/runtime/lib/checkpoint/cache_storage.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3081e69122075b14c00cf2a4c5b1fef14e74cbab19fa8e16f95dcb203ea74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/python/src/helpers.rs:1906-1918 | sdk/python/src/helpers.rs:1920-1933 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/python/src/helpers.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"337049ecb565bd7b11316d3ff5a5e04371d562dbf0f4d5177cad9e817ab8ef8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sdk/python/src/sandbox.rs:1138-1153 | sdk/python/src/sandbox_handle.rs:334-349 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24504f4eb0fb12458a9f21982a6ee05ca6099036e8daa4841e88fff64aaf2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/go/native/src/lib.rs:3360-3371 | sdk/go/native/src/lib.rs:3951-3961 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd28a11a15dec4df0ea386f97ac5a9651f0f72c1ea1f100234797910ce282297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/volume/fs.rs:546-557 | sdk/rust/lib/volume/fs.rs:564-577 \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":"sdk/rust/lib/volume/fs.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a45a108f97473835d218c2a6034297922ae5a49c5bb8b757f6491a503db0b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentd/lib/agent.rs:3910-3920 | sdk/rust/lib/runtime/spawn.rs:1615-1633 \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":"crates/agentd/lib/agent.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1399d4f04717578a1be9e2fb45afc8a55821ad824ed45d2a83de071aeecb0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/network/lib/engine/dns/forwarder.rs:857-866 | crates/network/lib/engine/dns/forwarder.rs:1002-1012 \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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ac36a222bf899fc340822c39c555284ccfab91785c982d5c7e45944ced4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): sdk/go/native/src/lib.rs:6790-6802 | sdk/go/native/src/lib.rs:6811-6824 | sdk/go/native/src/lib.rs:6886-6898 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6790}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeb7ce4f87e6deb2b6ee4fde332fbfef7cd3b9c93b3d8d1ba921ce9513a1489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/cli/lib/sandbox_config.rs:1590-1602 | sdk/rust/lib/sandbox/builder.rs:2341-2355 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59d11f95241a119e128818e4371df82d18b628c32938c00b8c36c7ab299539a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/go/native/src/lib.rs:6849-6857 | sdk/go/native/src/lib.rs:6865-6876 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b704c2b849b26acf253e89f9d6446fd488866200940e658ca826d63ba62a0f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): sdk/python/src/sandbox.rs:1364-1378 | sdk/python/src/sandbox_handle.rs:368-382 | sdk/python/src/sandbox_handle.rs:574-585 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0c81a12cdb63d1e3daf875ced0d5f2ca0a5556589cdabaaeff9e35956fb4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/python/src/sandbox.rs:1870-1882 | sdk/python/src/sandbox.rs:1919-1931 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"333c5263fe87f8943261b020796593b4982e693e34738fcfd1b4cff7afc154ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): sdk/go/native/src/lib.rs:3177-3188 | sdk/go/native/src/lib.rs:3234-3243 | sdk/go/native/src/lib.rs:3252-3263 | sdk/go/native/src/lib.rs:3271-3280 | sdk/go/native/src/lib.rs:3288-3297 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aff603cf2e6d08ee5c11f0ce070aa03478b949125c2d5cd7b4eb2f4b8725ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/go/native/src/lib.rs:3196-3207 | sdk/go/native/src/lib.rs:3215-3226 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f35501d5e97ea9c1256b6aaa854ad06de63610b66a41847114a0443abcb858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): sdk/go/native/src/lib.rs:4503-4516 | sdk/go/native/src/lib.rs:4524-4540 | sdk/go/native/src/lib.rs:4786-4801 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"102109878badb4c2e953d7ec7f8ae52616a4d63e0f3957e10a369b3fa463305f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/agentd/lib/network.rs:346-355 | crates/agentd/lib/network.rs:358-367 \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":"crates/agentd/lib/network.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ad40d935ac0f959dc9fa2ac54bdebc4ada797e1fdbca58b949f3eb4a9fbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/image/lib/archive/docker.rs:1855-1867 | crates/image/lib/archive/docker.rs:1873-1885 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c271e1cf254570ff4197b4399f0c4542795863adb089692646a3a85bc0a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): sdk/go/native/src/lib.rs:2746-2760 | sdk/node-ts/native/sandbox_handle.rs:488-501 | sdk/ruby/ext/microsandbox/src/lib.rs:697-711 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"482a45b49a2dd64d342a09d5678e954e1ddcf7437082fc681dac69c4e4e8e71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/backend/cloud/http.rs:523-539 | sdk/rust/lib/backend/cloud/http.rs:541-554 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc36ca018eea8bf3f1fec37629248def05cef749d497f44dea8c71386672686"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/runtime/lib/checkpoint/owned_disk.rs:610-619 | sdk/rust/lib/backend/local/snapshot/archive/delta.rs:445-455 \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":"crates/runtime/lib/checkpoint/owned_disk.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca44afbd6727d2c1b5b053e1547ae626b684e5a15dd5c2339eb6c2851d81cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): sdk/go/native/src/lib.rs:3305-3314 | sdk/go/native/src/lib.rs:3322-3331 | sdk/go/native/src/lib.rs:3339-3348 | sdk/go/native/src/lib.rs:4209-4219 | sdk/go/native/src/lib.rs:5572-5583 | sdk/go/native/src/lib.rs:6718-6728 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f248199436c91f903ce2fca038afb8bd03c97fc0a4c2b7b04b177af1c1d64079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/go/native/src/lib.rs:3472-3490 | sdk/go/native/src/lib.rs:6174-6184 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3472}}}],"partialFingerprints":{"codehealthFindingId/v1":"670fd17737a61ad7efeb02cc8771eae49d0b863b15b0bd8afe210103433c084e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sdk/node-ts/native/sandbox.rs:934-949 | sdk/python/src/sandbox.rs:2701-2718 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f790b01e12e9e8e7c8477843a011f146a4c4f77c6c5ac4f87337f324c323ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/agentd/lib/agent.rs:1867-1882 | crates/agentd/lib/agent.rs:1889-1904 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"6233fe2b709ac9068bce47893ee47c16f4e0119e4f25a9091eeaab524041a160"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/cli/lib/commands/self_cmd.rs:755-766 | crates/cli/lib/commands/self_cmd.rs:3228-3239 \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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d28e75754243d71260b75244d7bae1789cf84d8232aade09dad2c6089fd4c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/python/src/agent.rs:35-47 | sdk/python/src/agent.rs:56-68 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/python/src/agent.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8f537e03ecd3c90e57f31f865de7747c01beab25e48d9cb892a3eeade7b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:2288-2295 | sdk/ruby/ext/microsandbox/src/lib.rs:2350-2357 | sdk/ruby/ext/microsandbox/src/lib.rs:2400-2408 | sdk/ruby/ext/microsandbox/src/lib.rs:2457-2465 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5e57f37d647974a150f2ec4e864669ce96f895c1878fbf183c911225e28d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/rust/lib/agent/bridge.rs:119-137 | sdk/rust/lib/agent/bridge.rs:140-152 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/rust/lib/agent/bridge.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f70c2b411ad18a1dc366ada809dd64d38022fa780b1677c4068b498dfa36c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/node-ts/native/mount_builder.rs:227-241 | sdk/node-ts/native/root_disk_builder.rs:86-100 \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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55124d42fe8df6d06f782e7234eb887e8c6434e99ff0779fdde1629b462028e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/python/src/setup.rs:29-38 | sdk/python/src/setup.rs:46-55 \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":"sdk/python/src/setup.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b3669ac2afdada0101d18154c1083946235f1f8ee5e99effa1178eb87fe877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/python/src/ssh.rs:229-240 | sdk/python/src/ssh.rs:310-318 | sdk/python/src/ssh.rs:326-336 \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":"sdk/python/src/ssh.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"928c4854eb188a10c3e4530d4e4b98f0ebe5ef64c840051b394fb6bb2dad0504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/filesystem/lib/backends/memfs/dir_ops.rs:225-240 | crates/filesystem/lib/backends/memfs/dir_ops.rs:249-258 \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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b321a04113bedb3c45797f0c4b2a0cb4e4e1de217ca31b3b56102ee50f0b1915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/image/lib/snapshot/migration.rs:609-625 | packages/microsandbox-types/rust/lib/snapshot/disk.rs:64-81 | sdk/rust/lib/backend/local/snapshot/archive.rs:4375-4391 \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":"crates/image/lib/snapshot/migration.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"465b8f5938ac6838db8072ba4fa13c258656fbb23eafa87a7fcc9870860c6f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/runtime/lib/checkpoint/disk.rs:1393-1400 | crates/runtime/lib/checkpoint/owned_disk.rs:828-835 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95542c3292adf23577a99d3cc6ca94e40cf526f621fae47b9f0fbddcb7b56ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/protocol-client/rust/lib/client.rs:226-241 | packages/protocol-client/rust/lib/client.rs:254-262 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/rust/lib/client.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2541f3213343d7349fd377278219cd9f508c8321df3ed1698762801dde0b070"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1353-1360 | sdk/python/src/sandbox.rs:1489-1496 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dbe70174b206c11cd0cd2535d0e3c53f1d662dafb60f40a368b64f0851313c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/agentd/lib/fs.rs:1107-1124 | crates/agentd/lib/fs.rs:1126-1143 \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":"crates/agentd/lib/fs.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f97e6d71d941422ebd52e3333168c02222cd2ab6a3481bc94d67ab6ca5edaa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/image/lib/checkpoint/manifest.rs:354-366 | packages/microsandbox-types/rust/lib/snapshot/disk.rs:206-218 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/image/lib/checkpoint/manifest.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad0dde8380f63b8a67dcdd41487a04ec90aa0b4f806737c18103ec81a5aa87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/image/lib/ext4/formatter.rs:842-861 | crates/utils/lib/extent.rs:136-154 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"861540943123a0c164ec57740476aebe0551dbf9d32a374c4682811a8216a76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/image/lib/ext4/rootfs.rs:162-174 | sdk/rust/lib/backend/local/snapshot/archive.rs:4306-4321 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1505-1517 | sdk/rust/lib/sandbox/storage_preview_lower.rs:220-232 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/rootfs.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffb5d1b8808735d38b8dcc2be57eaf0a2692b8a4de4693f701fb255fd1b5e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/cli/lib/commands/self_cmd.rs:3128-3149 | crates/cli/lib/commands/self_cmd.rs:3162-3178 \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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":3128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b68bb0cab1bc7c9000f98ea7cff9844cbe184fabe607ff6d6b1621b23b5aa35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/runtime/lib/checkpoint/migration/preview.rs:421-431 | crates/runtime/lib/checkpoint/migration/source.rs:575-587 \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":"crates/runtime/lib/checkpoint/migration/preview.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d8f1aa1139397cf3e6ef0595a79b0815d0293f617300dd0aac930a267abb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/runtime/lib/runner/clock.rs:155-164 | crates/runtime/lib/runner/relay.rs:1419-1426 | crates/runtime/lib/runner/vm.rs:2901-2908 | crates/runtime/lib/runner/vm.rs:3456-3463 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/clock.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8612484ead18ba702f8e0bc5ec6fdefb0b48715da9594a87bed67be0231c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 9\u002B corresponding lines): sdk/python/src/fs.rs:49-57 | sdk/python/src/fs.rs:60-68 | sdk/python/src/fs.rs:71-81 | sdk/python/src/fs.rs:100-110 | sdk/python/src/fs.rs:113-122 | sdk/python/src/fs.rs:185-193 | sdk/python/src/fs.rs:196-204 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/fs.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41f199c0c1a5e3c9a8a98a237f752c8bdc6f2f784a28441aefd58fb05fd0e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentd/lib/network.rs:534-544 | crates/agentd/lib/network.rs:552-566 \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":"crates/agentd/lib/network.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd92b1390b6f963c40e5baf0332fdc7f1f70f198cea1510dfe387abe6748fba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): sdk/python/src/exec.rs:202-211 | sdk/python/src/fs.rs:253-262 | sdk/python/src/logs.rs:103-113 | sdk/python/src/metrics.rs:86-96 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/exec.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf3d2b7548b28d5ef369ffe58fc0842b3296bc964209ff3e168756f759b3393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/cli/lib/sandbox_config.rs:1040-1055 | crates/cli/lib/sandbox_config.rs:1057-1069 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa3bc18e63eb55274d6f6d9ad27428b6e69e8120540b2a9c7dafd84b9e7ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/network/lib/model/config/types.rs:323-343 | packages/microsandbox-types/rust/lib/domain.rs:1984-2004 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"crates/network/lib/model/config/types.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05371f40b066ee89fe85ae402122c842e2ac2195be436a409ad93d2010e8410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/network/lib/proxy/http_connect.rs:345-362 | crates/network/lib/proxy/socks.rs:511-527 \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":"crates/network/lib/proxy/http_connect.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14165d63f9222a31261f46b1ce0981d5cb748daf17c1078b0f17bae30b1a41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): sdk/go/native/src/lib.rs:4964-4974 | sdk/go/native/src/lib.rs:5106-5115 | sdk/go/native/src/lib.rs:5124-5133 | sdk/go/native/src/lib.rs:5142-5151 | sdk/go/native/src/lib.rs:5200-5209 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4964}}}],"partialFingerprints":{"codehealthFindingId/v1":"b173e75c88f4a0d1ed975853c60ab290bf9befacf4bc912cb89dd2aef0d26717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): sdk/python/src/fs.rs:89-97 | sdk/python/src/fs.rs:125-133 | sdk/python/src/fs.rs:136-144 | sdk/python/src/fs.rs:147-155 | sdk/python/src/fs.rs:158-166 | sdk/python/src/fs.rs:174-182 | sdk/python/src/fs.rs:212-222 | sdk/python/src/fs.rs:230-240 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/fs.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ee0716399c4f08a72a7fb6dc1ff9a6623083f32c18d254fd73c986fff7599b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sdk/python/src/ssh.rs:282-292 | sdk/python/src/ssh.rs:419-429 | sdk/python/src/ssh.rs:464-477 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"sdk/python/src/ssh.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e77e03fa2af5c05b9a3dc141cc7abffa3ab11b78f635e91f25f66bd94291c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/go/sandbox.go:1017-1033 | sdk/go/sandbox.go:1154-1168 \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":"sdk/go/sandbox.go"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c0e67ecfc21e745a6a454c71d5dc0e9e53f74ff07e4bde13daa697d20e0eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/node-ts/native/attach_options_builder.rs:134-146 | sdk/node-ts/native/exec_options_builder.rs:212-224 | sdk/node-ts/native/sandbox_builder.rs:718-725 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"558b365fa4065487f51be7ed615c4b7c0f1ab5c0c1cc03ff046d1e67f6b04f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/go/jobs.go:185-197 | sdk/go/jobs.go:293-304 \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":"sdk/go/jobs.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac81eef487f0fed488de09d2bf3e91f117acfb6320e688c4a531027c7fecf9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/filesystem/lib/backends/passthroughfs/owned_windows.rs:83-93 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:750-761 \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":"crates/filesystem/lib/backends/passthroughfs/owned_windows.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce3363ef030a42b704cf1c940c7a19fc3fc2f0770632a77b90b954bf495813b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/image/lib/async_gate.rs:109-129 | crates/image/lib/storage_lease.rs:282-301 \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":"crates/image/lib/async_gate.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed66d212453041f9d379c44cabd33319b27e1f318c8f8258fb07fcc97cc6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/python/src/image.rs:214-223 | sdk/python/src/image.rs:400-410 \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":"sdk/python/src/image.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e0d9abbed0614a7dd6f9745da490e64c6f54b54aefb863d56cb20277827f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/python/src/sandbox_handle.rs:353-364 | sdk/python/src/sandbox_handle.rs:394-406 \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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4075a14fff59be163febc4ce39bc0c01bb0bf243a0d5f918f83704564d182d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/cli/lib/commands/common.rs:3030-3041 | crates/cli/lib/commands/common.rs:3053-3063 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cab5d4d8b5f36d8c47555ac8af4ec9f4329ef9a9bb2aa8b65f0939c1f37f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/runtime/lib/checkpoint/cache_storage.rs:511-520 | crates/runtime/lib/checkpoint/cache_storage.rs:522-532 \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":"crates/runtime/lib/checkpoint/cache_storage.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"9311fe7515c0b47ff5d334279b861a36a58a0c6c9dacaa0f4327daa3d10d43a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/python/src/image.rs:173-182 | sdk/python/src/image.rs:227-234 | sdk/python/src/image.rs:385-396 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/python/src/image.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67cf6558f8091499c26844fe581947263fdf6f660cc178d4db5a6c41653147"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/agentd/lib/session.rs:1807-1817 | crates/agentd/lib/session.rs:1819-1828 \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":"crates/agentd/lib/session.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0478547d00ac29787b30ef18bd70faa42f50183299f83c08f5ffd01af09a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/image/lib/checkpoint/manifest.rs:340-349 | packages/microsandbox-types/rust/lib/snapshot/disk.rs:194-204 \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":"crates/image/lib/checkpoint/manifest.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef140d3e9683a1c21cae25dd63c0d867f177992eb665c39223dee1f5abaa087"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/migration/lib/m20261024_000001_sandbox_creation.rs:49-64 | crates/migration/lib/m20261029_000001_volume_creation.rs:34-50 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"crates/migration/lib/m20261024_000001_sandbox_creation.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d902b2d0cc17e64f8abe8ecaa5df228b795bc7e37d2f253bb6c4c069d579c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/network/lib/engine/secrets/handler.rs:387-399 | crates/network/lib/engine/secrets/handler.rs:3080-3097 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"04df9e9b470cb169758a1790933c877d5eed7c1c76f36daa962ea1a893930199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/runtime/lib/client/ipc.rs:522-531 | crates/runtime/lib/client/ipc.rs:542-551 \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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1ea9c37260bb9e7b237385afb7179d8d9d41f0cda6c249a1ba9c9343e1b8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/node-ts/native/attach_options_builder.rs:150-159 | sdk/node-ts/native/exec_options_builder.rs:228-239 \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":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1913c78ea855436d6814cdcaca12bb8923aa4b2f2a0a2decd4fe01d6e8bb4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/go/sandbox.go:1449-1461 | sdk/go/sandbox.go:1465-1479 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/go/sandbox.go"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eeedcef449285b8d3dacbb78a03166c0b2a9c8bd9c475da736551627581c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/image/lib/ext4/layout.rs:104-117 | crates/image/lib/ext4/layout.rs:120-129 \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":"crates/image/lib/ext4/layout.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14d2344427a96509b9e04c4ae1291b756acbc453109299a6eaf55c29cb40998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): sdk/go/sandbox.go:1053-1064 | sdk/go/sandbox.go:1081-1095 | sdk/go/sandbox.go:1270-1284 | sdk/go/sandbox.go:1293-1304 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/sandbox.go"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af448b3b85a54e5a93d4005fc335bd34722df4ba35981bbc4cd44f7658280bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/agentd/lib/session.rs:542-558 | crates/agentd/lib/session.rs:564-576 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/agentd/lib/session.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14a1bb6a11bd2c454f4f5ba174753c5b3d4d28e0ac98d2b0e941c304db751f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/network/lib/engine/netstack/poll.rs:1142-1155 | crates/network/lib/engine/netstack/poll.rs:1158-1174 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c82ceaf4de322e50a05347031b3ed3a41f70915c5aba8f6b12ddab12316454b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/control-client/rust/lib/request.rs:513-519 | packages/control-client/rust/lib/request.rs:521-527 \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":"packages/control-client/rust/lib/request.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3551930498ac9b3424dd9b05bcaa2dddab26e1c6dd37cf171b5b44ec42ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/node-ts/native/sandbox_handle.rs:503-513 | sdk/node-ts/native/sandbox_handle.rs:515-524 \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":"sdk/node-ts/native/sandbox_handle.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5474100df5a528ed94cb5f89356ffd0ed40d81b62094c04cf92b5a2cf26a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): sdk/python/src/ssh.rs:339-346 | sdk/python/src/ssh.rs:349-356 | sdk/python/src/ssh.rs:359-366 | sdk/python/src/ssh.rs:374-381 | sdk/python/src/ssh.rs:384-391 | sdk/python/src/ssh.rs:394-401 | sdk/python/src/ssh.rs:409-416 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 8 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/ssh.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e81cae756e1d7099556473e520d2c801514e13e3955e9221f3bca7781a0703d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/rust/lib/backend/cloud/sandbox.rs:185-193 | sdk/rust/lib/backend/cloud/sandbox.rs:199-209 | sdk/rust/lib/backend/cloud/sandbox.rs:216-225 \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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1948d443924a7ea48bf0e5555490d5297d8a7548f99fb4dfda0f3792b80a7035"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): sdk/rust/lib/backend/cloud/volume.rs:358-372 | sdk/rust/lib/backend/cloud/volume.rs:403-417 | sdk/rust/lib/backend/cloud/volume.rs:424-438 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"sdk/rust/lib/backend/cloud/volume.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e368fcf78bffbc5143e8eb1209efe5fd095ef62a77c16d76c1d1164dae8194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/backend/local/snapshot/downgrade.rs:1154-1169 | sdk/rust/lib/backend/local/snapshot/migration.rs:1031-1044 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"54994ddb49f53b760765e918d49e6d920aca679740e034770d85f802eddb9dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/agentd/lib/agent.rs:3632-3643 | crates/agentd/lib/agent.rs:3649-3660 \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":"crates/agentd/lib/agent.rs"},"region":{"startLine":3632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac832331801c1e138f1dd0e8647391639ffb743244adb4937822d74e275d7fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/runtime/lib/checkpoint/layout.rs:416-426 | crates/runtime/lib/checkpoint/migration/source.rs:888-898 \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":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62da509485f5c2747cc142547fe78e31cfc63ed9e057ca18384a96a1487c913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/go/native/src/lib.rs:3503-3511 | sdk/go/native/src/lib.rs:7120-7131 | sdk/go/native/src/storage.rs:71-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7fe38b84630a636a3d113785b696338ab081ba83604798a815479d22884f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/native/src/lib.rs:4191-4200 | sdk/go/native/src/lib.rs:5551-5561 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6d2e4752b6867f834b5b4b9134f252c3df915951d74c4b1802635424cfea17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): sdk/node-ts/native/network_builder.rs:144-151 | sdk/node-ts/native/network_builder.rs:159-166 | sdk/node-ts/native/restore_builder.rs:270-281 | sdk/node-ts/native/sandbox_builder.rs:94-101 | sdk/node-ts/native/sandbox_builder.rs:357-364 | sdk/node-ts/native/sandbox_builder.rs:440-447 | sdk/node-ts/native/sandbox_builder.rs:769-780 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 8 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"293814814667bf8629637bc0b3890fff9a93d11b1b01bc63f801549dfeeb1256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sdk/node-ts/native/restore_builder.rs:398-408 | sdk/node-ts/native/sandbox_builder.rs:865-876 | sdk/node-ts/native/sandbox_builder.rs:883-894 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe91cd2cbcdb78d0f688865f6365f411d2676659a45ea3ec3d2fbab85a783506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/rust/lib/runtime/spawn.rs:2004-2020 | sdk/rust/lib/runtime/spawn.rs:2033-2052 \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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"7289163fee95a1fd716914ab5e8b4bec584cdf665aff892cd42c17497a32d7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/cli/lib/commands/copy/host_windows.rs:354-368 | crates/cli/lib/commands/copy/host_windows.rs:398-412 | crates/cli/lib/commands/copy/host_windows.rs:415-428 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c728d4ed6d364e9483fdd0c7dc26b1f6a791564ecd43789855b482f555c940b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/filesystem/lib/backends/passthroughfs/window.rs:128-140 | crates/filesystem/lib/backends/passthroughfs/window.rs:148-158 \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":"crates/filesystem/lib/backends/passthroughfs/window.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ec3c3358a1b4737592730e8d93f6dc6e0a1cc96bd964c0894ff31eeb6006b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/image/lib/cache/store.rs:837-844 | crates/image/lib/cache/store.rs:847-854 | crates/image/lib/layer/download.rs:325-334 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"crates/image/lib/cache/store.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f2f42427da84fface0539489a6a4828168ba27f65b68a7a91987fb5ccd6e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/runtime/lib/checkpoint/cache_storage.rs:361-368 | crates/runtime/lib/checkpoint/cache_storage.rs:402-409 | crates/runtime/lib/checkpoint/cache_storage.rs:417-424 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"crates/runtime/lib/checkpoint/cache_storage.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff9904b05462119c9b9d9217ae6b4e74c63ff38772b4f6cb63934d5e4105acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/runtime/lib/runner/control/dispatch.rs:334-347 | crates/runtime/lib/runner/control/dispatch.rs:353-364 \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":"crates/runtime/lib/runner/control/dispatch.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9beb1a159c29a73f2cf4889873c6f60c9abf9b1aafafc1f0515c781ff70bfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/go/native/src/lib.rs:6199-6207 | sdk/go/native/src/lib.rs:7206-7220 | sdk/go/native/src/lib.rs:7282-7296 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6199}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ebfdc39d802071cf6a645c744770040b1aefe97e3625ce44c236917de32f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): sdk/node-ts/native/outbound_proxy_builder.rs:93-105 | sdk/node-ts/native/outbound_proxy_builder.rs:109-120 | sdk/node-ts/native/outbound_proxy_builder.rs:124-135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"sdk/node-ts/native/outbound_proxy_builder.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"deac5605f198dc48359bcf22f2e7d72da91543286069637dd8d265c516344516"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/node-ts/native/setup.rs:40-49 | sdk/node-ts/native/setup.rs:53-62 \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":"sdk/node-ts/native/setup.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a1803755b407c4fe5d862022521c5d21561bfc380e27fc98c69a7cb9568646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1514-1522 | sdk/ruby/ext/microsandbox/src/lib.rs:1529-1539 | sdk/ruby/ext/microsandbox/src/lib.rs:1566-1574 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c356fc222b3ffb50266c8437664ac7ab3a74f96a840e14eef57e5cb6165d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): sdk/rust/lib/backend/cloud/volume.rs:318-332 | sdk/rust/lib/backend/cloud/volume.rs:338-352 | sdk/rust/lib/backend/cloud/volume.rs:444-458 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"sdk/rust/lib/backend/cloud/volume.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb9c3abb53184a9b65c4f1fe698b4e7f728c958d443101555099a76a2e0e948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/rust/lib/volume/fs.rs:610-619 | sdk/rust/lib/volume/fs.rs:625-636 \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":"sdk/rust/lib/volume/fs.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb054223ad7be6257c620b4f3d1be4af3b94e007b475c3b38eb55c0fd9f9391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/go/modify.go:204-217 | sdk/go/modify.go:221-234 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/go/modify.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b30d132e1d64a8b9dcd3fb08dbf9b048f8dc72055d41bf5abc4b9720c5399a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentd/lib/session.rs:486-496 | crates/agentd/lib/session.rs:498-508 \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":"crates/agentd/lib/session.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"948b582ae9e8e1477e9f7367218291d22eb0fb540cfdd64c9566c012dedbdffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/cli/lib/commands/copy/host.rs:264-276 | crates/cli/lib/commands/copy/host.rs:315-328 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/cli/lib/commands/copy/host.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e955187506c5e266e13a3b25c07085c2ec332d22f6fdb8e800c700d935ec57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/filesystem/lib/backends/passthroughfs/owned.rs:713-732 | crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:911-927 \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":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cf13c2ebc0bdbe86f9381cd48c17b7bc83e0a6c4cdfc7637d093f5838c6164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/node-ts/native/network_builder.rs:412-423 | sdk/node-ts/native/sandbox_builder.rs:816-824 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f44f4a22b730783f362d895ae7429dba0b841ddada47e92654e8a04840ac48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/image/lib/checkpoint/store.rs:716-727 | sdk/rust/lib/backend/local/snapshot/verify.rs:483-495 \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":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd5848e65818678b4c8140c713a9463ead6b1d6a1c0b59b3f77466aa04350f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vsock/lib/stream.rs:47-60 | crates/vsock/lib/windows.rs:98-111 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"crates/vsock/lib/stream.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4254499a733e428cac622989f57a5220a414048835da93cb90d0911d89134892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/native/src/jobs.rs:73-82 | sdk/node-ts/native/jobs.rs:194-206 \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":"sdk/go/native/src/jobs.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54b9c63303f3a6acaee4f2c6695ca0ce809e37f1c38ab9c150079165dc1b876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): sdk/go/native/src/lib.rs:299-309 | sdk/go/native/src/lib.rs:328-338 | sdk/go/native/src/lib.rs:357-367 | sdk/go/native/src/lib.rs:5371-5378 | sdk/go/native/src/lib.rs:5494-5501 | sdk/go/native/src/lib.rs:7153-7160 | sdk/go/native/src/lib.rs:7175-7182 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 8 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e8462aa4325dbba10e913e1aed7e5478d7739da8f76364016919e9cd29b4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/go/native/src/lib.rs:4231-4239 | sdk/go/native/src/lib.rs:5315-5323 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"553caf54867605a65774a40ff59c73a0b28823d784f8453d6d0a25f348139347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/node-ts/native/network_builder.rs:174-184 | sdk/node-ts/native/network_builder.rs:231-238 | sdk/node-ts/native/sandbox_builder.rs:656-663 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"512a093b8949548a155b111ea9ae1e5fa93c2cb6eeb925de898d853206ba4591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/python/src/image.rs:151-156 | sdk/python/src/image.rs:161-169 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/python/src/image.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc487c88ce45442eedfdbfb686a1273bc26c04d386d538d111dc3307ef5dacbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:284-291 | sdk/python/src/sandbox.rs:565-575 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73fb80a6343b9b7470415653a51f8bba24937bd476c1a1b9ea931f87b10ef18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1430-1437 | sdk/ruby/ext/microsandbox/src/lib.rs:1830-1837 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa72b0e47a5817400b83ea1809987e6c2407d3575b5ce7a47530f2d0c917d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/filesystem/lib/backends/passthroughfs/windows/inode.rs:85-97 | crates/filesystem/lib/backends/passthroughfs/windows/inode.rs:99-113 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/filesystem/lib/backends/passthroughfs/windows/inode.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0943ab45296c4e713ed7ca7cee88f869127dd8cd1c8ac584761e497a3694c730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/microsandbox-types/rust/lib/cloud/secrets.rs:239-247 | packages/microsandbox-types/rust/lib/cloud/secrets.rs:251-259 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/cloud/secrets.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da7c5a0b1d7dec0c363f1e7a6f8fa9d9e9d09f00fc2491a42a744aee3ce652f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): packages/microsandbox-types/rust/lib/snapshot/external_mounts.rs:53-64 | packages/microsandbox-types/rust/lib/snapshot/guest_clock.rs:55-66 | packages/microsandbox-types/rust/lib/snapshot/restore_defaults.rs:59-68 \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":"packages/microsandbox-types/rust/lib/snapshot/external_mounts.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf2e3ce862f0c2b0e0ed0c809077a4c648f5897a58c3c33e3f470ceccd9d688"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 10\u002B corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1541-1550 | sdk/ruby/ext/microsandbox/src/lib.rs:1576-1585 | sdk/ruby/ext/microsandbox/src/lib.rs:1592-1601 | sdk/ruby/ext/microsandbox/src/lib.rs:1608-1617 | sdk/ruby/ext/microsandbox/src/lib.rs:1619-1628 | sdk/ruby/ext/microsandbox/src/lib.rs:1630-1639 | sdk/ruby/ext/microsandbox/src/lib.rs:1646-1655 | sdk/ruby/ext/microsandbox/src/lib.rs:1662-1671 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdee27670c358bc4e7ba322296410559d73543e3bbf363f95543c06c63572040"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/cli/lib/commands/ssh.rs:290-298 | crates/cli/lib/commands/volume.rs:308-318 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/ssh.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfbc8a594f549141fd16f225b68d48406a7b901caa68e372c2adde7765e8886"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/cli/lib/commands/ssh.rs:382-390 | sdk/rust/lib/sandbox/ssh.rs:2788-2796 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/ssh.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b3dc4cb3a7788aa125914e8afc6fd45a7b6a1ed219234094f80fef0552f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/image/lib/cache/lock.rs:120-129 | crates/image/lib/storage_lease.rs:532-540 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/cache/lock.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b459c4fe9485752eca048b5baac7004a39fa64708221d5c678ccbfe198df00f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/node-ts/native/runtime_config.rs:113-122 | sdk/python/src/lib.rs:209-217 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/runtime_config.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8c5d6f19cfe1a1efa5550e10f52491a632b8be557cce1fcf605d205d4ab02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/python/src/sandbox.rs:246-254 | sdk/python/src/sandbox_handle.rs:38-46 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"693a3145b3c890a1a0a40f1740e1503b92d548a3020483d906a6fad9c409760b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sdk/rust/lib/backend/cloud/http.rs:224-240 | sdk/rust/lib/backend/cloud/http.rs:255-269 | sdk/rust/lib/backend/cloud/http.rs:275-285 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dcc930d73fe6e5b2c54e7e1e50505fa90c56c8082c33106b52ac2d28d9c536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): sdk/rust/lib/volume/fs.rs:669-674 | sdk/rust/lib/volume/fs.rs:676-681 | sdk/rust/lib/volume/fs.rs:696-701 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"sdk/rust/lib/volume/fs.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44c5ab8e03e1519af03da107552263b26ce10ac1502829727264fb74c8b73a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/node-ts/native/agent.rs:68-77 | sdk/node-ts/native/agent.rs:81-90 \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":"sdk/node-ts/native/agent.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac203983d2cb5c9ca797e76800d127f4b21a7ac49a737da681a0ec3aaad6008"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sdk/rust/lib/backend/cloud/volume.rs:262-278 | sdk/rust/lib/backend/cloud/volume.rs:298-312 \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":"sdk/rust/lib/backend/cloud/volume.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6399b64b36794a804e2420b91fb4951668322c6d23b402132c27e4b1d53932b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/agentd/lib/agent.rs:3662-3668 | crates/agentd/lib/agent.rs:3740-3753 | crates/agentd/lib/agent.rs:3779-3795 | crates/agentd/lib/agent.rs:3840-3846 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1808c627c808c362ba054ee8694470199cf15c24fda313917d6f8ec83ff116b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/filesystem/lib/backends/dualfs/xattr_ops.rs:24-33 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:41-53 \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":"crates/filesystem/lib/backends/dualfs/xattr_ops.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c7dca263cf3b47486374a48e510c462a6022ba3d70bf269b5c86a9685ae9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/builder.rs:61-77 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:561-580 | crates/filesystem/lib/backends/passthroughfs/windows/builder.rs:254-271 \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":"crates/filesystem/lib/backends/passthroughfs/unix/builder.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a373067af78eab67dd0435d727f212ef40b8cb6452679a9316553884d24f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/network/lib/engine/ports/publisher.rs:898-908 | sdk/rust/lib/sandbox/modify/modify_ports.rs:226-237 \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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"376a289d0f68d0c3823abb4140d3c554f63ae57138218660a572bd682031a280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/runtime/lib/runner/cpu/allocation.rs:463-472 | crates/runtime/lib/runner/cpu/allocation.rs:474-481 | crates/runtime/lib/runner/writeback/admission.rs:743-752 | crates/runtime/lib/runner/writeback/admission.rs:754-761 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4420d604dc66560606c73fd29276104dcfcf38e7d672fd4434ae582bb51f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/node-ts/native/patch_builder.rs:84-92 | sdk/node-ts/native/patch_builder.rs:101-114 | sdk/node-ts/native/patch_builder.rs:123-136 \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":"sdk/node-ts/native/patch_builder.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ac54da8ebdfd22a0cc2d68e002a3caba095a23ae5538daf0f4f92fbec30ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/cli/lib/commands/copy.rs:153-160 | crates/cli/lib/commands/copy.rs:286-294 | crates/cli/lib/commands/copy.rs:302-310 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcacd0494770770f6958e15ea7e45add8d451abd60e024845e44193a4a3c99d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/native/src/lib.rs:2425-2434 | sdk/python/src/helpers.rs:1285-1294 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a2db71e813293e203e20d2d28f413ed5eb0097c210daf402340fd79e3176b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): sdk/go/native/src/lib.rs:3520-3530 | sdk/go/native/src/lib.rs:3571-3579 | sdk/go/native/src/lib.rs:3752-3760 | sdk/go/native/src/lib.rs:3768-3776 | sdk/go/native/src/lib.rs:3807-3817 | sdk/go/native/src/lib.rs:3825-3833 | sdk/go/native/src/lib.rs:3846-3854 | sdk/go/native/src/lib.rs:3862-3870 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a106cea5e23ba58e892c4235a243519e1ca1fc412d49bbfc6df51045e7a6116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/node-ts/native/network_builder.rs:326-333 | sdk/node-ts/native/registry_builder.rs:96-105 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be292f69d4fb53b17eee9d0d70492ca8b7f0ee6d897861ae5253f6cbeb40e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/backend/local/creation.rs:236-249 | sdk/rust/lib/backend/local/volume.rs:103-118 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/backend/local/creation.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcd35a2d7c5d5168f540e6edb2e8a88bd7296b056513bb3c8dd609ac09eaa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): sdk/go/image.go:34-44 | sdk/go/image.go:75-85 | sdk/go/snapshot.go:463-473 | sdk/go/snapshot.go:475-485 | sdk/go/volume.go:63-73 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/image.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a53ba633d1ec38d3845df30b483bd7bce9789c0801529b88b8c4f1a3b19c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/cli/lib/commands/common.rs:3566-3576 | crates/cli/lib/machine_cmd.rs:129-140 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c563d00348f98a292c0ae4259bc80ad0d0e02c5cac51f48aa5d184e0aae533a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/runtime/lib/checkpoint/local.rs:113-122 | crates/runtime/lib/checkpoint/local.rs:125-132 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/local.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"54004430ea1aea0c04f9798b75b81b56cdbb45da79cf5d292414ab4a197131b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/go/native/src/lib.rs:2826-2836 | sdk/python/src/sandbox.rs:1776-1786 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67ccb37ea79783ee214cf6a03a81426bd8bbf3b4adbd877e1b7ebbbe594d18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): sdk/node-ts/native/restore_builder.rs:59-65 | sdk/node-ts/native/sandbox_builder.rs:149-156 | sdk/node-ts/native/sandbox_builder.rs:160-167 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dfe8bf5dc7b1044a9e2e46c7f0ec351c4ccc89256a0391b8a08a69285be490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/sandbox.rs:344-349 | sdk/node-ts/native/sandbox.rs:374-382 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09087f6fb3653ce3a663b11c47613551639f2dcb4279b936014968b0c0d4e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/python/src/exec.rs:150-157 | sdk/python/src/exec.rs:160-167 | sdk/python/src/fs.rs:265-276 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/python/src/exec.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba937f628f09f4ad9bd0f7e2b626eee5a4388a4fdd939a68245333e34c4c5b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): sdk/python/src/fs.rs:299-308 | sdk/python/src/fs.rs:322-331 | sdk/python/src/sandbox.rs:1499-1508 | sdk/python/src/sandbox.rs:1511-1520 | sdk/python/src/sandbox.rs:2486-2500 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/fs.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6932063a0dd667a65ad6564d5af9fa8af7ea9c3c3f96d2aa6a9131d1a75b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:956-963 | sdk/python/src/sandbox_handle.rs:164-171 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8818ba75d04b877db429b179bec48c2795640c70b83f4a1e83f3d648a557e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:966-973 | sdk/python/src/sandbox_handle.rs:177-184 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bac844be0d6f8afbe3924171df48227b46dd7fbfe0d67a3732587ff580aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1479-1486 | sdk/python/src/sandbox_handle.rs:674-681 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"210827fe2abebc7682dcdf9c85aff6a17965361c4af47096d24e364f51b147ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/python/src/snapshot.rs:321-339 | sdk/python/src/snapshot.rs:509-517 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/snapshot.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfacfc9c504b2615567379b511cd643c4e51aa142d5e1db2102318b580743fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): sdk/rust/lib/backend/cloud/http.rs:143-152 | sdk/rust/lib/backend/cloud/http.rs:158-167 | sdk/rust/lib/backend/cloud/snapshot.rs:227-236 \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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"961e1be0cea7219225f4dfe9568b80ed92de1f493b9674afc277a01a0b5f8270"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/rust/lib/sandbox/external_mounts.rs:486-492 | sdk/rust/lib/backend/local/snapshot/group.rs:897-903 \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":"sdk/rust/lib/sandbox/external_mounts.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b12e3534018461e909b027e98fff856710c433396cf1b07eccd942891a3c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/agentd/lib/agent.rs:4086-4093 | crates/agentd/lib/agent.rs:4204-4211 | sdk/rust/lib/sandbox/mod.rs:1650-1657 | sdk/rust/lib/sandbox/ssh.rs:3214-3221 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":4086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72a02d008fb6007e86ff6b85e53bf1b182c4def13bcd731d2ec2aa79783df66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentd/lib/init.rs:466-483 | crates/agentd/lib/init.rs:505-515 \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":"crates/agentd/lib/init.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90ae5a5c90aac2a8afe51d52c798df15a2ed4f5222fbe2b05ff7b0dffb59b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/cli/lib/commands/copy/host.rs:105-113 | crates/cli/lib/commands/copy/host_windows.rs:103-115 | crates/cli/lib/commands/copy/host_windows.rs:118-130 \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":"crates/cli/lib/commands/copy/host.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"88358d7f0266d80e4a1082ee3b22caf8bce56ec07552aab1a8cb856f953e29fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 7\u002B corresponding lines): crates/cli/lib/commands/self_cmd.rs:2923-2930 | crates/runtime/lib/client/boot_error.rs:148-155 | crates/runtime/lib/client/ipc.rs:769-775 | crates/runtime/lib/client/maintenance.rs:933-939 | crates/runtime/lib/runner/heartbeat.rs:198-204 | sdk/rust/lib/image/cleanup_journal.rs:418-424 | sdk/rust/lib/sandbox/mod.rs:1738-1744 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":2923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d251ee016b235401ec22fc1ebecb31901796794781600e26618701535a708ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/filesystem/lib/backends/singlefilefs/mod.rs:374-386 | crates/filesystem/lib/backends/singlefilefs/mod.rs:395-404 \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":"crates/filesystem/lib/backends/singlefilefs/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"56612dc736792d0402d075c02bfa5e492ddda2d53f3b437de368be0c00dc773b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/runtime/lib/checkpoint/layout.rs:559-572 | crates/runtime/lib/checkpoint/owned_disk.rs:813-821 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"75241024abc829fdde1510738159372409ce06c654c58e875d2fa56358fc6504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/native/src/lib.rs:1801-1813 | sdk/go/native/src/lib.rs:1820-1829 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d31af2967bfc73cf5621925bb957720e7867735652059780670e886b9a99fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): sdk/node-ts/native/network_builder.rs:118-124 | sdk/node-ts/native/network_builder.rs:306-312 | sdk/node-ts/native/network_builder.rs:316-322 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6cf4fbf8a620ae7ef115344f2e3a2141c7e2dcf976920598aaa53b88a6fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:942-949 | sdk/python/src/sandbox_handle.rs:151-158 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9459944927ad19f58983b36a27b8aecc94fef3ad1b65b8b7fe87e5f52906d9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sdk/python/src/sandbox.rs:1414-1422 | sdk/python/src/sandbox_handle.rs:118-125 | sdk/python/src/sandbox_handle.rs:611-619 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb4e3978dacd64d8c33f3fd1d3a49501490ae3d4fbcb4f54f84a4d112aa48a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:608-616 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:742-749 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71e0d2d9d686627653ee1f53f292344f306bf79e216fb5046ec8aa2c3ea5fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/node-ts/native/jobs.rs:220-226 | sdk/python/src/jobs.rs:341-347 \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":"sdk/node-ts/native/jobs.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbecdcf10c2a317666f13e3e68b5f299801427aab583a118b162afc2e36b4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sdk/node-ts/native/snapshot.rs:335-343 | sdk/node-ts/native/snapshot.rs:346-354 | sdk/node-ts/native/snapshot.rs:373-384 \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":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05aefce427fecdd558cc08df09496f80ed38883fa329c71cab3d227a76005d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/go/sandbox.go:586-597 | sdk/go/sandbox.go:599-609 \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":"sdk/go/sandbox.go"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac94a861d862419d71cc9634fcbfe01de35dd786cb13e8820c4c3b428d0cfe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentd/lib/agent.rs:1242-1256 | crates/agentd/lib/tcp.rs:401-411 \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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966cc40031e84fd2dd5b54b3c29f1bb340d3c5f62e34cd1e565b1a3293d434a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/image/lib/tree/model.rs:623-637 | crates/image/lib/tree/model.rs:639-651 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/image/lib/tree/model.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d79f2f57d5d5ef9f9ad48466ee8e707566580e65ee9f34edf11e4ce6874b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/migration/lib/m20260305_000002_create_sandbox_tables.rs:113-121 | crates/migration/lib/m20260305_000003_create_storage_tables.rs:136-144 | crates/migration/lib/m20260719_000001_create_cpu_allocations.rs:151-159 \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":"crates/migration/lib/m20260305_000002_create_sandbox_tables.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2cca5b6c3b85fd0e1a6e8eb9490fd6adb9d0a9de3cad87155334981717794a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/network/lib/engine/tcp/proxy.rs:180-192 | crates/network/lib/engine/tls/proxy.rs:121-133 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"118b13d96322b3bad2a5d7efd2e19202108a5a4243f4c830f9e51bf41224990b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/node-ts/native/fs.rs:183-189 | sdk/node-ts/native/volume.rs:319-325 \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":"sdk/node-ts/native/fs.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a5318842ef05ffc3954fa56bab1f4e37e347bde78577083b0cbbe6c4141baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/sandbox.rs:906-911 | sdk/node-ts/native/sandbox_handle.rs:447-455 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93a9c0d517bfb71a7db89fd0e01b853d0015226e573ad92b56645ac5601578b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/node-ts/native/secret_builder.rs:287-297 | sdk/python/src/helpers.rs:2417-2427 \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":"sdk/node-ts/native/secret_builder.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"66349b43b05da1453bfd5eb75b4a58f6c90d5cbd3c7843a8d5d7d5df77fded59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/jobs.rs:289-298 | sdk/ruby/ext/microsandbox/src/jobs.rs:230-237 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/jobs.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58e70dc2ad17e22779545df843d46e16a5fac101134defc7fc15d1a644f5d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/agentd/lib/fs.rs:1494-1499 | crates/agentd/lib/tcp.rs:870-874 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"crates/agentd/lib/fs.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb250b93d832f92c130a7a7691d72756e6f4f6ff3251b27cd0fe80dec99152b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/go/native/src/lib.rs:4060-4070 | sdk/ruby/ext/microsandbox/src/lib.rs:2582-2590 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dcb93c1335603e075d485ea25bb9df24daa70d930ef0b02ea0e1c6554d9c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/node-ts/native/storage.rs:89-99 | sdk/python/src/storage.rs:94-102 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/storage.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3d68c19071121c02c5d605dd5a8913f38e6a8cbc27650c4ef81d4a6cdbc96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk/node-ts/native/storage.rs:190-200 | sdk/python/src/storage.rs:164-174 \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":"sdk/node-ts/native/storage.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cfba1e83d4c7f86dfb79d1bce46656db7c76a1f6cb92448c8899c260bcb650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/ruby/ext/microsandbox/src/lib.rs:1417-1424 | sdk/ruby/ext/microsandbox/src/lib.rs:1817-1824 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bab6a5456268d534b17689254c02cfe132f561ca332630f4e29f816d9c7e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): sdk/rust/lib/backend/cloud/http.rs:289-298 | sdk/rust/lib/backend/cloud/http.rs:304-313 | sdk/rust/lib/backend/cloud/http.rs:455-464 | sdk/rust/lib/backend/cloud/snapshot.rs:370-380 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee6ed336e1ba2e81af2455b2cc57afe651320f0bcf0069ffd592a7c265cc23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/rust/lib/backend/local/snapshot/verify.rs:235-245 | sdk/rust/lib/backend/local/snapshot/verify.rs:347-355 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/verify.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b927ef7f41094f089fc39a4676bdc435f4e8289cc9f6ce2d16074a1959ae95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/volume/fs.rs:683-694 | sdk/rust/lib/volume/fs.rs:703-715 \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":"sdk/rust/lib/volume/fs.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fb9c54d9477adbd4583ca09524972550e992ee4127e5a8a9803f2f9709396f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/python/src/volume.rs:432-439 | sdk/python/src/volume.rs:524-530 \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":"sdk/python/src/volume.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d808d3549b63e16b4093731e184950ee04b0e0132580d675ad427bce72323440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/rust/lib/backend/cloud/http.rs:402-411 | sdk/rust/lib/backend/cloud/snapshot.rs:311-320 \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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8410fef3fee252fcbce86b678ce8c40283eef07800f74bf96e3c6c9ac5bb586"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/cli/lib/commands/common.rs:3455-3463 | crates/cli/lib/commands/modify.rs:674-682 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":3455}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d09dc3c2f72062dc23791a4bfb709dc688f7ecd71a5008e32498ebbdca651b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/filesystem/lib/backends/memfs/metadata.rs:25-33 | crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:39-49 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f804002e4c4e1b69203d2d83b41a3190b0ec3e698e087979cdf2fa23e1d8bc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/image/lib/tree/model.rs:653-665 | crates/image/lib/tree/model.rs:667-679 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"crates/image/lib/tree/model.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eee44eebfea58aef18b41b40d3fe5e2c2ac1621739ba37b362a220a2e6d8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/utils/lib/process.rs:67-81 | crates/metrics/lib/registry.rs:1521-1532 \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":"crates/utils/lib/process.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d92c8b0fe7598bb8c40e51213457d9663c2beb440a7e7916419dce3cf133ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/python/src/error.rs:142-152 | sdk/ruby/ext/microsandbox/src/lib.rs:387-393 \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":"sdk/python/src/error.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8de2909ad2a425945fac86b2173ad67ad897488007b12dbae3b415033c28c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/agentd/lib/process.rs:133-142 | crates/agentd/lib/process.rs:148-160 \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":"crates/agentd/lib/process.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11451ea8b708c961dd9cb0c240f6b31fd2050e10f0fc4a6deb7e4f6673e8d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/node-ts/native/sandbox.rs:1188-1197 | sdk/python/src/sandbox.rs:129-138 \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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f398687997599d34f0e9cc8e4573edeb854c5c77400c4492388ee81caaffde5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1333-1340 | sdk/python/src/sandbox_handle.rs:553-560 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f36756028e9d91548bfc58ec9f5e6fc96b0623e0b3600ab877a99b450063b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1343-1350 | sdk/python/src/sandbox_handle.rs:563-570 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e402ea14f288ebb71fc21bf7fa27bc74202cb880e8e901547d72635359ab64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1381-1388 | sdk/python/src/sandbox_handle.rs:588-595 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a068ff1a6d29052c90cf48f7462b9ec5c3f1ec9ecb76e040a386715f15b3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:1401-1408 | sdk/python/src/sandbox_handle.rs:598-605 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"650c92a6dc2da507f2a582719c60d8ef58dfd2548836e430437baec1f1245eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/cli/lib/commands/copy/host.rs:255-261 | crates/runtime/lib/client/memory_handoff.rs:20-31 \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":"crates/cli/lib/commands/copy/host.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca021cf81bd5f5d91771aa4bb41479e91cae2570b9a0678d68251e5eba371f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): sdk/node-ts/native/fs.rs:82-86 | sdk/node-ts/native/fs.rs:160-166 | sdk/node-ts/native/fs.rs:170-176 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"sdk/node-ts/native/fs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf20f59ad5ddfd9af9ec1fec1f9218b1146cd7549e4c31acbf52db891e8810f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): sdk/node-ts/native/mount_builder.rs:379-387 | sdk/node-ts/native/mount_builder.rs:389-397 | sdk/node-ts/native/numeric.rs:14-21 | sdk/node-ts/native/rate_limiter_builder.rs:147-156 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6276e714674a9dc39c0964ad506ea3589458fff560d9b3ada8eee1f7a44fc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/options.go:781-790 | sdk/go/sandbox.go:803-812 \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":"sdk/go/options.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b40edb691649f03e9ddd3e2f916f27a5a551049e08181c94e92901620d2a2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/db/lib/private_storage/storage.rs:167-175 | crates/runtime/lib/checkpoint/cache_storage.rs:616-627 | crates/runtime/lib/checkpoint/layout.rs:549-557 | sdk/rust/lib/runtime/storage_aliases.rs:1031-1043 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/db/lib/private_storage/storage.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfe0d0fc3d740dd5bc76df8d43836c00b8f90cd66a0b30bf4330f41793dd02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): sdk/node-ts/native/sandbox.rs:309-317 | sdk/node-ts/native/sandbox.rs:332-340 | sdk/node-ts/native/sandbox.rs:358-366 | sdk/node-ts/native/sandbox.rs:393-401 | sdk/node-ts/native/sandbox.rs:435-443 | sdk/node-ts/native/sandbox.rs:447-455 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd0de27a64fb4515d96157247da2c5929dfd5b59dfa50517534debf1100c6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/python/src/helpers.rs:1883-1891 | sdk/node-ts/native/sandbox.rs:1323-1331 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e692e92399465055fbd9f33ab41adcec71971df8347b71ee16b95b7439d80d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/go/sandbox.go:1212-1222 | sdk/go/compact.go:72-81 \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":"sdk/go/sandbox.go"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fe13ee43191109ee71b7ec8558c03907bc9ae6c4cb4cfe1bfb8f8288a1ddb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/cli/lib/commands/copy/host.rs:355-361 | crates/filesystem/lib/backends/passthroughfs/unix/host_mode.rs:107-113 \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":"crates/cli/lib/commands/copy/host.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3e22eb67d55aeee136323029ebb1be31b78f84e6d096f0e1a286d8bd2f28b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/filesystem/lib/backends/memfs/mod.rs:165-169 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:656-660 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"crates/filesystem/lib/backends/memfs/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdc793d0e6aeb1da6153bdff535c167a88546c5ea76a63c02f4ab4b272ae9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/image/lib/erofs/fsmeta.rs:74-85 | crates/image/lib/erofs/writer.rs:84-95 \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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4ed7df95b5ace8fce0e7c88dac6098c2dce9fc53dab643d24b93c9484ba89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/migration/lib/m20260703_000001_add_sandbox_active_config.rs:33-44 | crates/migration/lib/m20261022_000001_sandbox_caller_config_overrides.rs:33-44 \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":"crates/migration/lib/m20260703_000001_add_sandbox_active_config.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9393e514ec77fb835b424c13b4054ff1234f40479eb5ae354d5b650346269f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): sdk/node-ts/native/mount_builder.rs:298-304 | sdk/node-ts/native/sandbox_builder.rs:190-195 | sdk/node-ts/native/volume_builder.rs:76-83 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42d0f8844c9d9ff67337c1d268f2b972247de5b07cdd3b2fe5727cb9766f45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/sandbox_builder.rs:199-204 | sdk/node-ts/native/volume_builder.rs:87-94 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/sandbox_builder.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0d1315a0ede70d66f2cce5dc5233e21b42c764c090bef7c2a0b4ae592e8c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/image/lib/ext4/jbd2.rs:478-485 | crates/image/lib/ext4/resizer.rs:1289-1294 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"crates/image/lib/ext4/jbd2.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2753af144e27cd859ade97b6eec6be42b241a480984c5963e11f36f9c4fdaa7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): sdk/node-ts/native/exec.rs:138-144 | sdk/node-ts/native/fs.rs:206-212 | sdk/node-ts/native/volume.rs:286-292 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"sdk/node-ts/native/exec.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec9bc80eb0d34fbef937bb03462f90571e3aaaca69542d3d39f67dd8a1a4afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/image/lib/checkpoint/resolver.rs:411-420 | sdk/rust/lib/backend/local/snapshot/archive/delta.rs:1019-1028 \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":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0dda78823fd7119b54be8aa2ea11bfd4165bf9490ebd16329b22dac0c3f2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/go/native/src/lib.rs:2436-2444 | sdk/python/src/helpers.rs:1296-1304 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f95b30abd14fd0a6ce89724c2246ae1000432dd4be5fde76267acdae035c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/network_builder.rs:279-284 | sdk/node-ts/native/restore_builder.rs:348-353 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"22681d2b4f0e529afb2e143af06f1528a37c2fa520f4da7a7fc16b6f6f92dd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/restore_builder.rs:365-370 | sdk/node-ts/native/sandbox_builder.rs:634-639 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6216933c5e4a29780b61c83b215059d9e849aa7dcb103880223bee2030f9874e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/restore_builder.rs:374-379 | sdk/node-ts/native/sandbox_builder.rs:643-648 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e45ec7eda01f86d4d68ce5d66c14ee8357a2fa8eae5084f826d0fc5d960053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/cli/lib/commands/common.rs:1929-1937 | crates/cli/lib/sandbox_config.rs:1568-1576 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7f06dc739e36494869bdd8f4849468b0b9a7f202ff95a972e2e578ec5e3a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/python/src/sandbox_handle.rs:684-691 | sdk/python/src/volume.rs:402-408 \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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaf6e3c3cd3478daa10a0a0c53f7558643259a1093d150442f97a9dd35a604c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/network_builder.rs:289-294 | sdk/node-ts/native/sandbox_builder.rs:171-178 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bcfa802d2890c528bed979f9a67f5fb9ce556f4a30c637c79b81bbbdb1da3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): sdk/node-ts/native/dns_builder.rs:66-71 | sdk/node-ts/native/exec_options_builder.rs:147-153 | sdk/node-ts/native/sandbox_builder.rs:282-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"sdk/node-ts/native/dns_builder.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cbad46ae4092fc51d61f011682e71317f730567cbb0a2593efa8e09831328a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): sdk/node-ts/native/sandbox.rs:126-130 | sdk/node-ts/native/sandbox_handle.rs:63-67 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0196cbf4a01bf1e13cf154142406268c0522dabdaafbe28b35a2e9700d39fa9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): sdk/node-ts/native/storage.rs:128-138 | sdk/python/src/image.rs:637-643 | sdk/python/src/storage.rs:225-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"sdk/node-ts/native/storage.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"307c3da50b358991618ff21108b44123f8db171c5d28f58188be5233a4d34151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/snapshot_builder.rs:107-112 | sdk/node-ts/native/volume_builder.rs:98-103 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/snapshot_builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7aaf6fa000b17ce0e6bcf7141969232c1536b34799e5df5c566c143076334e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/db/lib/catalog.rs:38-47 | sdk/rust/lib/backend/local/creation.rs:307-313 \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":"crates/db/lib/catalog.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d013eba539c6273140de7d261df0f4768f18560c129c56682273b40c5f1a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/migration/lib/m20260703_000001_add_sandbox_active_config.rs:46-57 | crates/migration/lib/m20261022_000001_sandbox_caller_config_overrides.rs:46-57 \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":"crates/migration/lib/m20260703_000001_add_sandbox_active_config.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce8a9928b0ff0f591d0802265bee402a0545799e364f5cbaa35e147fc0a9e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/go/native/src/lib.rs:2842-2850 | sdk/python/src/sandbox.rs:1791-1798 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed5d11e3f27c0a1ca401cf9cd049ad50f4bda844a35cc74c91ded504b749ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): sdk/node-ts/native/exec.rs:166-170 | sdk/node-ts/native/sandbox.rs:298-302 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"sdk/node-ts/native/exec.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ea7d7cfa47cc3d4191605d31722796bcbbe3ba43d5a8f50d16126ccf514403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/python/src/exec.rs:188-194 | sdk/python/src/jobs.rs:232-237 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/python/src/exec.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83ee5e15c0f50016a42b9f5cb1e48a3f2a7f9568ff4e1a7a92bbca34d4c8829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/image/lib/checkpoint/store.rs:729-734 | sdk/rust/lib/backend/local/snapshot/verify.rs:507-513 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf972920d6fa9968c227cacd65c38b193d8e45a44737b087400079946ff1d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/filesystem/lib/backends/dualfs/dir_ops.rs:659-667 | crates/filesystem/lib/backends/dualfs/lookup.rs:174-182 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b03a47dd0b36a20226ffedf56e79f86dad76a212b5fdf31ce2e11ea32dbe7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/python/src/sandbox.rs:519-526 | sdk/python/src/volume.rs:134-141 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d58169af20cf9951fa003973b454f160de9dbe18e701141c2ebe71cc4fcbac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/go/sandbox.go:1186-1192 | sdk/go/snapshot.go:381-387 \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":"sdk/go/sandbox.go"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"334494a4cba941b43bbef81874566ee2614e731f5eee303a9c72ee2b7b9f6acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/migration/lib/m20260501_000001_create_snapshot_index.rs:154-164 | crates/migration/lib/m20260517_000001_drop_sandbox_metric.rs:36-46 \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":"crates/migration/lib/m20260501_000001_create_snapshot_index.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2492105c4b864b66b713715e72434931995330791437e3359c4cc27c66480da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/python/src/exec.rs:179-185 | sdk/python/src/jobs.rs:75-80 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/python/src/exec.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"225ecea23805d242c1e1d56327400e9f32d94983b46befc247116868abb369c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/protocol/lib/control/message.rs:349-353 | crates/protocol/lib/message.rs:477-481 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"crates/protocol/lib/control/message.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e48e367c6d6e1f02e43bd748809b589cbb966223814a5c855a8607be39b651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/microsandbox-types/rust/lib/domain.rs:1564-1572 | sdk/rust/lib/volume/mod.rs:493-503 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/domain.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a87d73f66175df01fefcc0c37ebc925a7398eac1b829097e354f44595714d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/rust/lib/sandbox/handle.rs:1053-1059 | sdk/rust/lib/volume/mod.rs:567-572 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc78f9c72836a5013ffd9c5c03278668e4b1ad3a29931ae9b8f8d910e7cae7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/node-ts/native/snapshot.rs:161-164 | sdk/node-ts/native/volume.rs:71-74 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a2f3f14550d2d67ba7b71ff966c69512a56c23be96bea1a56064128f56b62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/go/agent.go:84-90 | sdk/go/snapshot.go:510-516 \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":"sdk/go/agent.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5188265fa2a92df1e40c102fd6bcdde98dd4aff52bddf358b7605dbec71bf70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:514-519 | crates/filesystem/lib/backends/passthroughfs/windows/mod.rs:229-234 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"crates/filesystem/lib/backends/passthroughfs/unix/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccccdeec2bcd02b44bfc5a35b434ac322565a242ec5b9d91dd766b1b3671a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/agentd/lib/agent.rs:3451-3456 | sdk/rust/lib/sandbox/jobs/terminal.rs:294-299 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca932a458849ab88f241b1f7e2f17f2af819e8cbc7ffe6f4e671b1050fea51c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/image/lib/async_gate.rs:57-63 | crates/image/lib/storage_lease.rs:233-239 \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":"crates/image/lib/async_gate.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8aae230fbde47b0928e239e78633c43d05bacc399225f23e181e820ccaca85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/node-ts/native/sandbox.rs:117-122 | sdk/node-ts/native/sandbox_handle.rs:54-59 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae1a286420aeca531d0ee2d9385c6eb763a671817ecb49646337c393d5e6e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/rust/lib/backend/local/snapshot/archive.rs:1504-1507 | sdk/rust/lib/snapshot/api.rs:688-691 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22562195d38ba582c2f05c95a3b1699464633385acc082c3d46c08388dd4c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/agentd/lib/config.rs:584-592 | crates/cli/lib/commands/common.rs:3436-3442 | sdk/go/native/src/lib.rs:1913-1921 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"crates/agentd/lib/config.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf01f744bbc77f60f94b5e8dacff72fee0021277ea75360aba09b40e1fac5a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sdk/go/fs.go:169-175 | sdk/go/storage.go:35-41 \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":"sdk/go/fs.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd948bcf934f6fa290d0831e5733592fd242a6858704d47153c0cfeff40d3a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/filesystem/lib/backends/dualfs/lookup.rs:160-167 | crates/filesystem/lib/backends/memfs/mod.rs:206-213 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7b310941d2325958252ef812dc96f4a73026d31815228f0c939259b77b667d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/node-ts/native/network_builder.rs:451-454 | sdk/node-ts/native/sandbox_builder.rs:897-900 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7ecf4e202b1231584fcd843e41f1986ad3d57aee1ae0e4cdfcc56606998e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): sdk/rust/lib/backend/local/snapshot/create.rs:2142-2147 | sdk/rust/lib/backend/local/snapshot/lease.rs:51-55 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ef1ea3f3bb11e157faeba4e83711fb913b92baa12fb483ab763a96918a2739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/network/lib/proxy/http_connect.rs:366-371 | crates/network/lib/proxy/socks.rs:432-437 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"crates/network/lib/proxy/http_connect.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8859d8f18afaa1c119d4c2aa6d3eeb07e930545610f3bd114574889e9ffa98d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/node-ts/native/numeric.rs:23-26 | sdk/node-ts/native/sandbox.rs:1318-1321 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/node-ts/native/numeric.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58830015b113ef3371e69cf80cde2735f4f291fcd9a297ec4bd36b9d8091c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/python/src/exec.rs:74-78 | sdk/python/src/ssh.rs:183-186 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/python/src/exec.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79d551d2004d6a14e1c7826a1a9bae9999ad93e0c6d349bbe76eecbb1a6e686"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/python/src/exec.rs:82-86 | sdk/python/src/ssh.rs:190-193 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/python/src/exec.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb8a41c73667ffbe0a7275a1135165181dcc47fb0c0483eb2777d69dfd1a105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1291-1346 | sdk/rust/lib/backend/local/snapshot/archive.rs:1414-1469 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1291\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b277f466da7db2be543595b00a0dbfb84f0d144f21ff11e84b508edddff010e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201344 lines \u00D7 2): crates/image/lib/archive/docker.rs:828-869 | crates/image/lib/archive/docker.rs:1104-1147 \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 \u0060crates/image/lib/archive/docker.rs:828\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a809e054247d8b3425cd6029b7ab8d2b66fcf19f11e03ea58c638548b67ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:3267-3308 | sdk/rust/lib/backend/local/snapshot/archive.rs:3466-3506 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:3267\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"df657eb79ffbd7ac3f88c1dedce3a696a969a3a5bd980520ca605fc761c38e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:958-997 | crates/image/lib/erofs/writer.rs:1271-1310 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/image/lib/erofs/writer.rs:1266\u0060 calls \u0060align_to_block\u0060 and \u0060crates/image/lib/erofs/fsmeta.rs:956\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"335ca4d5c72017358210ae01c6f40464ce2905a0b395e5ee4baa226dc0600893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201339 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:3316-3354 | sdk/rust/lib/backend/local/snapshot/archive.rs:3513-3547 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:3316\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3316}}}],"partialFingerprints":{"codehealthFindingId/v1":"03346fbb70d6993142880ac72e05d06c6677cb88e00e67cc3d54eee098aa3e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): sdk/go/native/src/lib.rs:5676-5712 | sdk/go/native/src/lib.rs:5732-5768 \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 \u0060sdk/go/native/src/lib.rs:5676\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5676}}}],"partialFingerprints":{"codehealthFindingId/v1":"490da684da67bb5c5d2ce3313c33d000312364c5a77e9a4ed06aa8633c569bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/create.rs:312-343 | sdk/rust/lib/backend/local/snapshot/create.rs:662-687 \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 \u0060sdk/rust/lib/backend/local/snapshot/create.rs:312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b66e320efe1fefa44f9b08d74394a774e6824d7a4d634f6599f531773299fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): crates/filesystem/lib/backends/memfs/special.rs:96-126 | crates/filesystem/lib/backends/memfs/special.rs:215-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/memfs/special.rs:96\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":"crates/filesystem/lib/backends/memfs/special.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ec5bcca279b480d2321baee2c673fdd6fde0377bb509a416fe814c43c5b39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:797-827 | crates/image/lib/erofs/writer.rs:1125-1155 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cbf1c73d2a59a0afd8e6f5111a735551e6f22b6065a809d65a3e4444bf66aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/remove_ops.rs:73-102 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:191-220 \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 \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs: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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c451251b046687c59c5eb816629c6af50e29b0f226873a1ad202e266f3a942"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:220-246 | crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:249-276 \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":"crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff9e3744586c7507619858872275af87df4e7c7d321a063e70bd3931aa0c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): crates/network/lib/engine/tcp/proxy.rs:835-862 | crates/network/lib/engine/tls/proxy.rs:446-469 \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 \u0060crates/network/lib/engine/tcp/proxy.rs:835\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b92023df9514fc52f259a4c8db0fb955658ec1c3f954144e8c336c39612da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:271-297 | crates/image/lib/erofs/fsmeta.rs:453-478 \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 \u0060crates/image/lib/erofs/fsmeta.rs:271\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06c68fda4b122305538e6fa7871a93e3caacd38bc147d593f822bc54eff16f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/network/lib/engine/udp/fragments.rs:338-364 | crates/network/lib/engine/udp/fragments.rs:444-470 \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 \u0060crates/network/lib/engine/udp/fragments.rs:338\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fragment\u0060 to \u0060Ipv4UdpFragment\u0060 in one and \u0060Ipv6UdpFragment\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"febd5f203abd6cb17794e1ca02bda40c4f88201f659890c01045e7f77aa3adbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): sdk/go/native/src/lib.rs:4840-4866 | sdk/go/native/src/lib.rs:4885-4911 \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 \u0060sdk/go/native/src/lib.rs:4840\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f0e320fcdef674ca8c7fc18eeb1a72d661835a75b938dd8479a7c0fc48dfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201333 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/archive.rs:927-959 | sdk/rust/lib/backend/local/snapshot/archive.rs:1049-1078 | sdk/rust/lib/backend/local/snapshot/archive.rs:1153-1182 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:927\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da37627c5e71c68d18eeb8ede126069be0f6e2d8a76c6f43916661b01bcaeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:623-647 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:784-808 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f73e5fd2eff3576e5d9e49a1581eb7d29c47cbb7984ff6980ebe75eb77c1aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 3): crates/agentd/lib/agent.rs:1302-1322 | crates/agentd/lib/agent.rs:1405-1428 | crates/agentd/lib/agent.rs:1444-1464 \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 \u0060crates/agentd/lib/agent.rs:1405\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e05058a2fc43adb6053298fedfaf529735d96cae19c4b7d2ad587a693fa4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/file_ops.rs:204-226 | crates/filesystem/lib/backends/dualfs/file_ops.rs:305-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:204\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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f0e608d18384b34a97171f5c405161df12b3cdd33f1a36f82b447813461501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2260-2283 | crates/runtime/lib/runner/vm.rs:2428-2451 \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 \u0060crates/runtime/lib/runner/vm.rs:2260\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb095ea20db3298db9a6eaf29f44e9a2591396522fa748220cf460175ec087d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:3357-3380 | sdk/rust/lib/backend/local/snapshot/archive.rs:3550-3573 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:3357\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77b5b4b5a9bb5f3993ea5c5ed79784d96407e6ef04659bac7fc9e92cb61a5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 4): crates/filesystem/lib/backends/memfs/create_ops.rs:68-90 | crates/filesystem/lib/backends/memfs/create_ops.rs:152-173 | crates/filesystem/lib/backends/memfs/create_ops.rs:248-269 | crates/filesystem/lib/backends/memfs/create_ops.rs:317-338 \u2014 all 4 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 \u0060crates/filesystem/lib/backends/memfs/create_ops.rs:68\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/create_ops.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f56e1ea77e10978ad3063d9f45ad76acb96680e0586fca80dc774a02ad7b64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 4): crates/image/lib/erofs/fsmeta.rs:633-651 | crates/image/lib/erofs/fsmeta.rs:822-838 | crates/image/lib/erofs/writer.rs:976-998 | crates/image/lib/erofs/writer.rs:1150-1166 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fada7e0043478365a1d9601e95113b599cab196191e1d6bfd6672414c700b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/lookup.rs:417-439 | crates/filesystem/lib/backends/dualfs/lookup.rs:475-497 | crates/filesystem/lib/backends/dualfs/lookup.rs:532-554 \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 \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:417\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":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acf388a3bcaf42c1126c762b2a6b20442acb54e6bd65477f514444da2c24db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/remove_ops.rs:38-60 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:148-169 \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 \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:38\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78bf5b91dc5f34f3d3c7ba420aabdcbe6eafeb80d9cd3dd1cc82551bdc1a856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:516-536 | crates/image/lib/erofs/writer.rs:794-816 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e4d323bc1544c9edbc91faf8e3eb3240f6d8c7f5399bba51092b16d8f08b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/migration/lib/m20260305_000001_create_image_tables.rs:239-261 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:286-308 \u2014 before extracting anything, compare \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:239\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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f0d1844a17aeb111e365ae90b5abb3c071ff6cae41a119bd63d96b804c3afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/runtime/lib/runner/relay.rs:4241-4263 | crates/runtime/lib/runner/relay.rs:4329-4351 \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 \u0060crates/runtime/lib/runner/relay.rs:4241\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08dc7ae39af722b3c8373fd3c4b51dbdc8399be1bad22ae990c3d444a4167c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/utils/lib/process_lock.rs:139-161 | crates/utils/lib/process_lock.rs:248-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 \u0060crates/utils/lib/process_lock.rs:139\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/lib/process_lock.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a09ef54ff0e88c29625c26ba35bb33cd068d3a5ae786c5800aa425845f546a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): sdk/python/src/image.rs:674-704 | sdk/python/src/sandbox_handle.rs:711-741 \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. 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":"sdk/python/src/image.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"09019ec68d5d85d7878a4ea3db1f314395d307a91b557388b840eac0efeabef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/create.rs:358-380 | sdk/rust/lib/backend/local/snapshot/create.rs:698-719 \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 \u0060sdk/rust/lib/backend/local/snapshot/create.rs:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42d08d54367876939ab599f690ce55f5e655908954047889b2754518201fd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): sdk/go/native/src/lib.rs:2248-2269 | sdk/python/src/helpers.rs:1100-1121 | sdk/python/src/helpers.rs:1193-1214 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:2248\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34453d9920cd36789a4a8765b2de405b4a78fa0f0b6b61507ae087883e2a749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/cli/lib/commands/copy.rs:189-210 | crates/cli/lib/commands/copy.rs:239-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/copy.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6e81f25bc61b5f1a93244e6510eb8d7448976a76f9a4a519dbbc09693722ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/cli/lib/commands/common.rs:913-933 | crates/cli/lib/commands/common.rs:1170-1190 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dbdd9ed630363a9e915843773656d637f2748868700c494a6ba49c1561c54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/lookup.rs:818-838 | crates/filesystem/lib/backends/dualfs/lookup.rs:878-898 \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 \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:818\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a664710646d12e40c95f525376ab5b4f750dd4fb15ec208d1b88acf8f0ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/agentd/lib/config.rs:671-690 | crates/cli/lib/commands/common.rs:2394-2413 \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 \u0060crates/agentd/lib/config.rs:671\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":"crates/agentd/lib/config.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"102ebd3d781771ffa2263d97c0f2ea7507c05f47bfc3bfb21686df6342978dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:279-297 | crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs:303-322 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 44 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:279\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":"crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48773f36926d13ec505c11358bcc1f972f3b0dd48054ec9d70e4e6d280b8f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/image/lib/cache/store.rs:169-188 | crates/image/lib/cache/store.rs:210-229 \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 \u0060crates/image/lib/cache/store.rs:169\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":"crates/image/lib/cache/store.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11c137bded915144131f631b1850f2988fb4ea8ede29385a44feea4144057ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/image/lib/checkpoint/store.rs:339-358 | crates/image/lib/checkpoint/store.rs:407-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e75f6da3b69897c61ed2bb4edaec6b909f65c78eddee005693d07a4a419d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/network/lib/engine/tcp/proxy.rs:279-298 | crates/network/lib/engine/tcp/proxy.rs:301-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/tcp/proxy.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b9efae2f1c9a6805e73b0e0bcef2ae9ec3c0c6d2d6819ade524795be64a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/network/lib/model/policy/types.rs:517-535 | crates/network/lib/model/policy/types.rs:567-586 \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 \u0060crates/network/lib/model/policy/types.rs:517\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":"crates/network/lib/model/policy/types.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0cbe11f0ccfe13b6dc23e61185bf3b2d624a9d495d52856abf98eed8270495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): packages/microsandbox-types/rust/lib/cloud/modify_plan.rs:231-250 | packages/microsandbox-types/rust/lib/cloud/modify_plan.rs:256-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/microsandbox-types/rust/lib/cloud/modify_plan.rs:231\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060plan\u0060 to \u0060SandboxModificationPlan\u0060 in one and \u0060CloudSandboxModificationPlan\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/cloud/modify_plan.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0556295d19815e7550c49b4104cc01ee87421cd312f39ac5f5630e62dd0a34e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): sdk/python/src/sandbox.rs:1045-1064 | sdk/python/src/sandbox_handle.rs:258-277 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1045\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8068124332fec15afdd60661a0f6a69b3e5aed2dc64ed834a64e4b31fec6284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 4): crates/filesystem/lib/backends/dualfs/file_ops.rs:358-376 | crates/filesystem/lib/backends/dualfs/file_ops.rs:438-454 | crates/filesystem/lib/backends/dualfs/special.rs:117-135 | crates/filesystem/lib/backends/dualfs/special.rs:291-307 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/special.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:358\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. 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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e322532a11a7a443301c7380098e1df2bd5e76fe8df8153b2adef6341f2193c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/agentd/lib/session.rs:2000-2018 | crates/agentd/lib/session.rs:2032-2050 \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 \u0060crates/agentd/lib/session.rs:2000\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56815574927dbcc5f3c8c908f8076fa754221a9ef76430d8821aa107afbecb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/create_ops.rs:184-200 | crates/filesystem/lib/backends/dualfs/lookup.rs:72-90 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:184\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f55fe9e6d6340f2d81852cb7e69b945795316aa258eabd8516d4f982242a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/image/lib/archive/docker.rs:952-970 | crates/image/lib/archive/docker.rs:1206-1224 \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 \u0060crates/image/lib/archive/docker.rs:952\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea40c3c4bc5efc8448f76aa0796b8274383fa4d891cd0ea36fd4f25ff7d0fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/image/lib/erofs/writer.rs:589-607 | crates/image/lib/erofs/writer.rs:696-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/writer.rs:589\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":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b4eea0a97a2492ab482dc4390baa196538b0ec7a7806d10d996e4a28366e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/image/lib/tree/model.rs:448-466 | crates/image/lib/tree/model.rs:471-489 \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":"crates/image/lib/tree/model.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d023e51294988712d6eb145822aa79a094e00fcb4567e0fb41b04da9f954bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/migration/lib/m20260305_000001_create_image_tables.rs:200-218 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:253-271 \u2014 before extracting anything, compare \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:200\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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9e28bc58d01ffc7795be24f087fc2a476d82f26cd19217177983f77d1c62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/network/lib/engine/netstack/poll.rs:479-497 | crates/network/lib/engine/netstack/poll.rs:500-518 \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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"76df6253897ebb35ee317296421a6b541863c13eedb5e862453badc528080341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/network/lib/engine/ports/publisher.rs:1334-1352 | crates/network/lib/engine/tcp/connection.rs:642-660 \u2014 before extracting anything, compare \u0060crates/network/lib/engine/ports/publisher.rs\u0060 and \u0060crates/network/lib/engine/tcp/connection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/ports/publisher.rs:1334\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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ac152ae63847c661f1861beee35697c89dee76ccb0d44edfede693128762a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/protocol/lib/codec.rs:101-119 | crates/protocol/lib/codec.rs:314-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/lib/codec.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ab66c7f173b17bcdfdbdd4b35667e6e6f48f5342f9c2e72bcb48ae9ecbd2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/runtime/lib/runner/relay.rs:4618-4636 | crates/runtime/lib/runner/relay.rs:4649-4667 \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 \u0060crates/runtime/lib/runner/relay.rs:4618\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6e5e23596ff48521c44294c78ff5d60e66fdfd0497338ca626c12baad9965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): sdk/go/native/src/lib.rs:2257-2274 | sdk/python/src/helpers.rs:1109-1126 | sdk/python/src/helpers.rs:1138-1155 | sdk/python/src/helpers.rs:1202-1219 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af8ce55a2f68b8456869cc671d1c75cf021eb63bd82e6d64eb39e241572ec83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 3): crates/utils/lib/process_lock.rs:60-73 | crates/utils/lib/process_lock.rs:150-167 | crates/utils/lib/process_lock.rs:259-276 \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 \u0060crates/utils/lib/process_lock.rs:60\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":"crates/utils/lib/process_lock.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b6ca20f84b0f095a0b71949a61791aa8d27c7a26e7c1c0f402bb8c3f0ccb54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/lib/commands/copy/host_windows.rs:451-468 | sdk/rust/lib/sandbox/patch.rs:1691-1708 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/copy/host_windows.rs\u0060 and \u0060sdk/rust/lib/sandbox/patch.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/copy/host_windows.rs:451\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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12f8252ea520330c2a1ddd3c0de58e49867b862b8d07d3ca9291c9673dec409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/lib/commands/ping.rs:97-114 | crates/cli/lib/commands/touch.rs:60-77 \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. 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":"crates/cli/lib/commands/ping.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86d19c19b0f9eb10fe845317560d6e20892a5cc5cef6b09d1da77a6c315ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/lib/commands/remove.rs:59-76 | crates/cli/lib/commands/volume.rs:271-288 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/remove.rs\u0060 and \u0060crates/cli/lib/commands/volume.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/remove.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060RemoveArgs\u0060 in one and \u0060VolumeRemoveArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/remove.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc38be628cdd4f50552e1670c12edf64f819a151cfac028aee48ad458729a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/migration/lib/m20260305_000001_create_image_tables.rs:267-284 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:316-333 \u2014 before extracting anything, compare \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs:313\u0060 calls \u0060col\u0060, \u0060big_integer\u0060, \u0060date_time\u0060 and \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:265\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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb6fdd9db8be799484bdfa1aff8cdd02fb0a1bb3d9316c7f708fb3b72dd659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/network/lib/engine/ports/publisher.rs:1315-1332 | crates/network/lib/engine/tcp/connection.rs:623-640 \u2014 before extracting anything, compare \u0060crates/network/lib/engine/ports/publisher.rs\u0060 and \u0060crates/network/lib/engine/tcp/connection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/ports/publisher.rs:1315\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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17215172a366483f489f9779428c4f948e404f2a7768e4e70fd4c9f3ab1f756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sdk/node-ts/native/image_builder.rs:69-86 | sdk/node-ts/native/sandbox_builder.rs:128-145 \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. 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":"sdk/node-ts/native/image_builder.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b993004f070beb786aca0744746856d42c690cf4f733f152c43219ca31e0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sdk/node-ts/native/mount_builder.rs:132-149 | sdk/python/src/helpers.rs:1183-1200 \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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d5eda0c6940a143359f1f3e8980d68b6e06796c820b808d399723f1d7ff6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1010-1027 | sdk/rust/lib/backend/local/snapshot/archive.rs:1114-1131 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1010\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a770737ec6fb0c98ba55ad5a29e62a6d2f486de7a50f8f21269f811876fc46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/restore.rs:179-195 | sdk/rust/lib/backend/local/snapshot/restore.rs:432-449 \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 \u0060sdk/rust/lib/backend/local/snapshot/restore.rs:179\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":"sdk/rust/lib/backend/local/snapshot/restore.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eead9565d321b47dfd1dc5881ffae455cedf3cf4f6871fefc046d0f362fa0b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): crates/image/lib/erofs/fsmeta.rs:680-693 | crates/image/lib/erofs/fsmeta.rs:856-869 | crates/image/lib/erofs/writer.rs:1015-1031 | crates/image/lib/erofs/writer.rs:1172-1185 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:680\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/image/lib/erofs/fsmeta.rs:675\u0060 calls \u0060RegularFile\u0060 and \u0060crates/image/lib/erofs/writer.rs:1014\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a65f0f84615b67d0f8033a25a4eb8a94bacf5004ee0e5d835423a764f0e5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 4): crates/image/lib/erofs/fsmeta.rs:696-709 | crates/image/lib/erofs/fsmeta.rs:872-884 | crates/image/lib/erofs/writer.rs:1040-1056 | crates/image/lib/erofs/writer.rs:1188-1200 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:696\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf6ac61b9c2fd7331bfe0489f892a5ff7034085243758a06831c2132ec42ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/create_ops.rs:275-289 | crates/filesystem/lib/backends/dualfs/create_ops.rs:336-352 \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 \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:275\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. 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":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a498bf4ff5a0697d1d1ba92b62ae46331f7b050c62720bad9e381d7c395e2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/filesystem/lib/backends/memfs/metadata.rs:162-178 | crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:316-332 \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 \u0060crates/filesystem/lib/backends/memfs/metadata.rs:162\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":"crates/filesystem/lib/backends/memfs/metadata.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7b8bf4cf028149cfedec8ad7f1b96465153e905e31a014e1bd865f232371b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:375-389 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:479-495 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:477\u0060 calls \u0060clone\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:373\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc5650bf71eab06dd03b022a7cc91febc364e361cfae296a6925bfd9c3c42d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:43-59 | crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:290-306 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/xattr_ops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"317df2fc538f4f04d78e6cefa1774fc811f1045ca0d4b837be0ceea3bae11708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/image/lib/archive/docker.rs:504-520 | crates/image/lib/archive/docker.rs:587-603 \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 \u0060crates/image/lib/archive/docker.rs:504\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfccabbe75e78d1856f6b047005eaa7ce853eb4bb597c6a6239de7870f4fb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/image/lib/tar/ingest.rs:276-292 | crates/image/lib/tar/ingest.rs:316-330 \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 \u0060crates/image/lib/tar/ingest.rs:276\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":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4db37feb08e060237a0870c6a36bf8d6b75ee216286a8336998a6b9fedcd25d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/runtime/lib/checkpoint/coordinator.rs:1424-1440 | crates/runtime/lib/checkpoint/coordinator.rs:1459-1475 \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 \u0060crates/runtime/lib/checkpoint/coordinator.rs:1424\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c3214e039f8cb9e64241c1f00ab25ac3fdccf1d0666af7b126d2b3fda3fa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1679-1695 | sdk/rust/lib/backend/local/snapshot/archive.rs:1701-1717 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1679\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82a4cdd9b0ae88d394d9c61874199bac5b9b407b0ac25dddc37ecf6f775cfac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/cli/lib/commands/ping.rs:48-63 | crates/cli/lib/commands/restart.rs:60-75 | crates/cli/lib/commands/touch.rs:42-57 \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 \u0060crates/cli/lib/commands/ping.rs:48\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060PingArgs\u0060 in one and \u0060RestartArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/ping.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f16ca6087cd4afa09c0506d08e294aa9d6b15b101019f60dc581475381579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/cli/lib/commands/remove.rs:62-77 | crates/cli/lib/commands/start.rs:52-67 | crates/cli/lib/commands/volume.rs:274-289 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/remove.rs\u0060 and \u0060crates/cli/lib/commands/volume.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/remove.rs:62\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060RemoveArgs\u0060 in one and \u0060StartArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/remove.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20897b8f8d82ad2a680a53000b179eae6f3726eb6ce15c21395d3165aff7646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/agentd/lib/init.rs:678-693 | crates/agentd/lib/init.rs:962-977 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spec\u0060 to \u0060\u0026DirMountSpec\u0060 in one and \u0060\u0026TmpfsSpec\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/init.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e87cf92ede79c9c358af5e255939015165f914c0366722b5c58ced750185c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/agentd/lib/init.rs:681-696 | crates/agentd/lib/init.rs:722-737 \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 \u0060crates/agentd/lib/init.rs:681\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spec\u0060 to \u0060\u0026DirMountSpec\u0060 in one and \u0060\u0026FileMountSpec\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/init.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a3d1bd0a9e71f436478e74e85d6cb23b9929db6e76e46f9a8088cf1256402e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/cli/lib/commands/install.rs:301-315 | crates/cli/lib/commands/install.rs:345-360 \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 \u0060crates/cli/lib/commands/install.rs:345\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":"crates/cli/lib/commands/install.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4a78a516b6fe14fb80d9e50227f7c8523ebe60b286cca76f651a3641975d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/cli/lib/commands/self_cmd.rs:2005-2018 | crates/cli/lib/commands/self_cmd.rs:2140-2155 \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 \u0060crates/cli/lib/commands/self_cmd.rs:2005\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa02dccc35d02209a772eba25be27e1115d157c39f7da6b5f79165ebf117c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/file_ops.rs:170-185 | crates/filesystem/lib/backends/dualfs/file_ops.rs:268-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:170\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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1493b8cc4c344dd8780e8801aa9eae4a981fa377aa7650b3522a4e79feb4465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/xattr_ops.rs:77-92 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:115-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/xattr_ops.rs:77\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/xattr_ops.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbfc6c61b7bbf973a6afc0b748b5ace544eeeb1349f36b56c9550d0b50e2ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:363-378 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:452-467 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:363\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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a275a98843282c63f0ae6f4b6d619dadebce0765f666e6e2e2eb58253f6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:38-53 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:164-178 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ebf7b97ae4b9e4d6046bfb1a9ff23e1585bc306829c4da34c97456a16d0e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:55-70 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:180-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8297d3b632d77daf260947479287132d04bbefc9dc2e29c67548e46805c3d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/metrics/lib/compatibility.rs:142-155 | crates/metrics/lib/registry.rs:721-736 \u2014 before extracting anything, compare \u0060crates/metrics/lib/compatibility.rs\u0060 and \u0060crates/metrics/lib/registry.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/metrics/lib/compatibility.rs:142\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":"crates/metrics/lib/compatibility.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741787e3e2bc5a84cc9390b8df6dbde40105999965db43f8891aebeacbfd131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/migration/lib/m20260305_000001_create_image_tables.rs:161-176 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:191-208 \u2014 before extracting anything, compare \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:161\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, \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:177\u0060 calls \u0060col\u0060, \u0060integer\u0060, \u0060not_null\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs:208\u0060 does not \u2014 after which the two agree again for 3 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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"82efb1761146798df47222710562cafe515cdf1416ef5d74cc06e9a3f383de30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/runtime/lib/client/maintenance.rs:378-393 | crates/runtime/lib/client/maintenance.rs:414-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38ff8e9fded30c548a0b136341603a42903c3bc3ff718ed45012cbf97a22b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): sdk/rust/lib/backend/cloud/http.rs:176-191 | sdk/rust/lib/backend/cloud/http.rs:202-214 \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 \u0060sdk/rust/lib/backend/cloud/http.rs:176\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3617c4da75259a9f357a5e5f0802419cbc634a857c99736b95efc1755ba1c42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:418-433 | sdk/rust/lib/backend/local/snapshot/archive.rs:457-472 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:418\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"756c341ed9072004455081b7e9bbfe501767082f5c0528f112e0c6f84f5b64fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1205-1220 | sdk/rust/lib/backend/local/snapshot/archive.rs:1359-1374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1222\u0060 calls \u0060as_file\u0060, \u0060expect\u0060 and \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1375\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52c9c9f511b7037fd626d99b74a752d172f29fd9dd2bedfbab7a28e8ac70868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1275-1289 | sdk/rust/lib/backend/local/snapshot/archive.rs:1398-1413 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1398\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b561d5a422f05bd1bbabb4591b416da326a662904cf67e5317910a2fd9483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sdk/rust/lib/snapshot/api.rs:289-304 | sdk/rust/lib/snapshot/api.rs:542-557 \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":"sdk/rust/lib/snapshot/api.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f576aa081bc0ec2f07cc58d09e8d438fa5d6382ca39671f2f0aadda6dd0c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/filesystem/lib/backends/dualfs/file_ops.rs:387-401 | crates/filesystem/lib/backends/dualfs/file_ops.rs:479-493 | crates/filesystem/lib/backends/dualfs/metadata.rs:248-262 | crates/filesystem/lib/backends/dualfs/special.rs:146-160 | crates/filesystem/lib/backends/dualfs/special.rs:330-344 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/metadata.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:387\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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"43582f7e3ce0ffa8f4cdfb1acf9bc7d6c788f55d65f40c241b978f22439e4143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/remove_ops.rs:73-87 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:191-205 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:397-411 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:89\u0060 calls \u0060mark_metadata_authority\u0060 and \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:414\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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e057652d8102f30b2224ea6b7f89638845ae1c1458494a67e78ab56a980b83f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/cli/lib/commands/self_cmd.rs:1417-1431 | crates/cli/lib/commands/self_cmd.rs:2354-2368 \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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6efbef75d4a9e753d60fe5dae2f447fa4b017d80e5347e2e7b06203b48995c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:680-694 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:852-866 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:680\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa544bd2ba4eccdc3a9375f85b81cbd79879c7d76cfe1f0653eb863c63f1a3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:328-342 | crates/image/lib/erofs/writer.rs:622-636 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:328\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf796ecb60b03e3fbcb867c6fefb2291aa6a03fd9d2306b0599a6f587d7091aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/image/lib/erofs/writer.rs:1069-1083 | crates/image/lib/erofs/writer.rs:1204-1218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/writer.rs:1069\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":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf52bfb3c96e811df0eff7cfa8581a11a7a1c51e2c78af65d517faa6b4f789e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/network/lib/engine/udp/fragments.rs:389-403 | crates/network/lib/engine/udp/fragments.rs:494-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae59323e4102d0b4d13f736841a383da150e8f603972776ce2a5d5e5ce29affb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): crates/network/lib/engine/udp/relay.rs:929-943 | crates/network/lib/engine/udp/relay.rs:1034-1043 \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 \u0060crates/network/lib/engine/udp/relay.rs:929\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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f0ab357427ee9e3c4ca528240b53db4172a994575103f2aeb0f0e46f5e2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/runtime/lib/checkpoint/migration/source.rs:1069-1083 | crates/runtime/lib/checkpoint/migration/source.rs:1199-1213 \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 \u0060crates/runtime/lib/checkpoint/migration/source.rs:1069\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 after the matched lines, \u0060crates/runtime/lib/checkpoint/migration/source.rs:1215\u0060 calls \u0060Err\u0060, \u0060into\u0060 and \u0060crates/runtime/lib/checkpoint/migration/source.rs:1084\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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fb7007f6b8ed90f7312bc1537cdaa6039130f7761588853049b45d620c07ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2089-2103 | crates/runtime/lib/runner/vm.rs:2132-2144 \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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b7fd3f9bc11554ce23d67f98d164b558645c81317a1b9cc303170aa5109a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sdk/go/native/src/lib.rs:1570-1584 | sdk/python/src/helpers.rs:1585-1599 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:1570\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b515324094f42ed1d29c0388b5c5f539f897099bc0fc67430f2834debe8299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sdk/go/native/src/lib.rs:7429-7443 | sdk/go/native/src/lib.rs:7461-7475 \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 \u0060sdk/go/native/src/lib.rs:7429\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2df6c9b6c1bd2fd95d0822b9f6469d117fada18f2322523d377512d262b195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): sdk/python/src/snapshot.rs:107-120 | sdk/python/src/snapshot.rs:162-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/snapshot.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6a69167674260274a2887f3802bcc66ce4960817dec377223c9917624c821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:900-914 | sdk/rust/lib/backend/local/snapshot/archive.rs:917-930 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:917\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efc3fa0c3bd0a146807d0aa49e1a4b751ca79861b711335d4e3ee883b4dd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sdk/rust/lib/snapshot/api.rs:212-226 | sdk/rust/lib/snapshot/api.rs:403-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"sdk/rust/lib/snapshot/api.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7cbd3621d370dae25d352f0da7b48e9f825016a596ddd54fb860be2830200b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/cli/lib/commands/image.rs:727-740 | crates/cli/lib/commands/remove.rs:59-72 | crates/cli/lib/commands/volume.rs:271-284 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/remove.rs\u0060 and \u0060crates/cli/lib/commands/volume.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/image.rs:727\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060ImageRemoveArgs\u0060 in one and \u0060RemoveArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ecd99a7e8cdf366eabedbe19c097361f6398daa257be60ac7d9eeb51c6d4cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/lib/commands/copy/host_windows.rs:212-225 | crates/cli/lib/commands/copy/host_windows.rs:277-290 \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 \u0060crates/cli/lib/commands/copy/host_windows.rs:212\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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecadf8bcaeaf4a253cb519727c278d9f99503d03a52f736ac96e72726e97c381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/lib/commands/image.rs:487-500 | sdk/go/native/src/lib.rs:6360-6373 \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":"crates/cli/lib/commands/image.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d3c3fa653d013d7bab1d29f6ae6c425b85a0031f4124abc396042b185ac10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/create_ops.rs:498-511 | crates/filesystem/lib/backends/dualfs/lookup.rs:767-777 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:498\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":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cc32522590d37b313b7ab4a953ce946fd84683dc3e215ee7f26047800185d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/lookup.rs:452-465 | crates/filesystem/lib/backends/dualfs/lookup.rs:500-513 \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 \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:452\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:498\u0060 calls \u0060register\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:449\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":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0a75e9065464a0936498d69f4b22264ced667799f3c3cde28c93ff9b6ce46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/builder.rs:202-221 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:367-386 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/passthroughfs/unix/builder.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/builder.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b731f2513bbf0b997ba396c20f42f418c25e6b44992ddf970fc034de6a041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/filesystem/lib/backends/shared/stat_override.rs:496-509 | crates/filesystem/lib/backends/shared/stat_override.rs:522-535 \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 \u0060crates/filesystem/lib/backends/shared/stat_override.rs:496\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/shared/stat_override.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3ceefa0ad43623643701adce5ac76b60906569c4c3ece0071689c0726336ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/image/lib/async_gate.rs:110-123 | crates/image/lib/storage_lease.rs:283-296 \u2014 before extracting anything, compare \u0060crates/image/lib/async_gate.rs\u0060 and \u0060crates/image/lib/storage_lease.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/async_gate.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9285e1c12243c3eb343bf54a2c08e8f705bcd2fcd04606bb02dfbe5f9428c290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/image/lib/async_gate.rs:146-159 | crates/image/lib/storage_lease.rs:330-343 \u2014 before extracting anything, compare \u0060crates/image/lib/async_gate.rs\u0060 and \u0060crates/image/lib/storage_lease.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/image/lib/async_gate.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f8347999c8d02ea75969a8e2de3091d1027b3c0b47fc9832d66d8da13b0f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/image/lib/ext4/formatter.rs:843-856 | crates/utils/lib/extent.rs:137-150 \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 \u0060crates/image/lib/ext4/formatter.rs:843\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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d312c6bd0f943df936ba0609b95e44551c7a5fc81c182abf29a515e0b6934fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/runtime/lib/checkpoint/cache_storage.rs:548-559 | crates/runtime/lib/checkpoint/migration/io.rs:119-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/checkpoint/cache_storage.rs:548\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":"crates/runtime/lib/checkpoint/cache_storage.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"792db7e5e65f739ac55ecf0a05c696f8eba0d5d903cede64941dc879d80be5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:1157-1170 | crates/runtime/lib/runner/vm.rs:1280-1290 \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 \u0060crates/runtime/lib/runner/vm.rs:1157\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9925db98f94372f8989d6c45f10b312d3162e359d2e5fc69a3b81efbe280e825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2061-2076 | crates/runtime/lib/runner/vm.rs:2114-2129 \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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34b65dfb31b373a449239e6286a5be34b9546a6fe9ff9ad72f6b5184118f9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sdk/go/native/src/lib.rs:2374-2387 | sdk/python/src/helpers.rs:1262-1275 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:2374\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155ea1213c0911c714ceda72cc94657547ca96402e8db534ea292ebb8723a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sdk/go/native/src/lib.rs:4333-4346 | sdk/node-ts/native/ssh.rs:270-283 \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 \u0060sdk/go/native/src/lib.rs:4333\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d05883321118f95527d4decb1b8e6ff28c9323419431d6d5ac8686ef6b2bd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/downgrade.rs:762-775 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1346-1359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060candidates\u0060 to \u0060\u0026mut [Candidate]\u0060 in one and \u0060\u0026mut [ReleasedFlatCandidate]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198288105285a87a592a0d52e14ef3a567146b1adf258462de239d5007381f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): sdk/go/native/src/lib.rs:4849-4861 | sdk/go/native/src/lib.rs:4894-4906 | sdk/go/native/src/lib.rs:5688-5700 | sdk/go/native/src/lib.rs:5744-5756 \u2014 all 4 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 \u0060sdk/go/native/src/lib.rs:4849\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73c0c7eb373980602c798c6443328fcb1ef1e954a2b301be7ac1da53faa73a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/file_ops.rs:154-166 | crates/filesystem/lib/backends/dualfs/file_ops.rs:252-264 | crates/filesystem/lib/backends/dualfs/file_ops.rs:423-435 \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 \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:154\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"808faef3296c3b83df714141d689af3190054626989a90d406dc4f7d00ebe167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/remove_ops.rs:92-104 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:210-222 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:414-426 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:89\u0060 calls \u0060mark_metadata_authority\u0060 and \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:411\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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc22060d14773f5262cd4caab6cf7f46dc00a080149c9d10fc85e4f3927f62c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/special.rs:102-114 | crates/filesystem/lib/backends/dualfs/special.rs:197-209 | crates/filesystem/lib/backends/dualfs/special.rs:276-288 \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 \u0060crates/filesystem/lib/backends/dualfs/special.rs:102\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/special.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e344aa75ebfe54f70f06671eb3a6282988841ace9361b6ee08fea8a91803ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:294-306 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:363-375 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:452-464 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:294\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:293\u0060 calls \u0060close\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:362\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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c744b87d6cd87cd76e51a20a9be979f4c787e04c116ec8d25f5b5e88415dc56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:830-842 | crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:835-847 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:428-440 \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. 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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af203eb9b3de37d43c9c1461032eb978fe50113fbd71db6f2cb990b6a7554a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:114-126 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:212-224 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:349-361 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:114\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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d7b54fc9fe3e92399a4eaba9a41c221b85b7f5252ce4293b8136ecd89e8913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/protocol/lib/codec.rs:105-117 | crates/protocol/lib/codec.rs:318-330 | crates/protocol/lib/codec.rs:384-394 \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 \u0060crates/protocol/lib/codec.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/lib/codec.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e4fc2bb2738bf25bade4f8f78588b06a4851daf2f5882e8fba5a8003f51bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/lib/commands/metrics.rs:431-443 | sdk/go/native/src/lib.rs:4920-4932 \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 \u0060crates/cli/lib/commands/metrics.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/metrics.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0962eb17d1ca76c2bb749227f3ac5dd97875e31f8c50434eedd9ad4d0ce1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/materialize.rs:297-307 | crates/filesystem/lib/backends/dualfs/materialize.rs:329-341 \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 \u0060crates/filesystem/lib/backends/dualfs/materialize.rs:297\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":"crates/filesystem/lib/backends/dualfs/materialize.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2808248cf36f592126ef0671dc093caa7ca3e48964fe5a8b7121e3963582470b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/filesystem/lib/backends/memfs/remove_ops.rs:24-36 | crates/filesystem/lib/backends/memfs/remove_ops.rs:75-87 \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 \u0060crates/filesystem/lib/backends/memfs/remove_ops.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6168db76446bff34068969f4e9b9dd0f564b0f57ac838666485197dc0525e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/filesystem/lib/backends/memfs/remove_ops.rs:249-261 | crates/filesystem/lib/backends/memfs/remove_ops.rs:351-363 \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 \u0060crates/filesystem/lib/backends/memfs/remove_ops.rs:249\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e254c3552308108b12d3ccc837194ec26a1ce093731412963166d73e0b90b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:196-208 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:214-226 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:209\u0060 calls \u0060load\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:227\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6aad722f4dc12431c12bfb24f080a5b325bedc7d25c767c1350f75c03773a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:291-303 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:368-380 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:381\u0060 calls \u0060restore_aliases\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:304\u0060 does not \u2014 after which the two agree again for 3 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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea518ad41fa4c219321551c448037f9e6d5da97a9a95355551048e582a38e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/image/lib/archive/docker.rs:490-502 | crates/image/lib/archive/docker.rs:571-583 \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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"01acdb2fdefc8a026c24f1cf7125d724c43611d0a6113a78e879bd4fc5f67655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/image/lib/archive/docker.rs:769-778 | crates/image/lib/archive/docker.rs:937-949 \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 \u0060crates/image/lib/archive/docker.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/image/lib/archive/docker.rs:768\u0060 calls \u0060clone\u0060 and \u0060crates/image/lib/archive/docker.rs:936\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2933e19bd3e938c3dbd14d468261aaa9cddac6d6dae60fda93009c628fcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:444-455 | crates/image/lib/erofs/writer.rs:670-682 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:444\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut FsmetaLayoutState\u0060 in one and \u0060\u0026mut LayoutState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/image/lib/erofs/writer.rs:689\u0060 calls \u0060RegularFile\u0060 and \u0060crates/image/lib/erofs/fsmeta.rs:458\u0060 does not \u2014 after which the two agree again for 3 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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ee29a33187254f3e9498b45b3093c2a761cb220f4e768bd2802d01b5de466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/image/lib/ext4/resizer.rs:861-873 | crates/image/lib/ext4/resizer.rs:1177-1189 \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 \u0060crates/image/lib/ext4/resizer.rs:861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0bbfff3828a626253bdb2863896581d9e9c6ba8830e03bf0260dd5ffbd490b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/image/lib/registry/client.rs:1676-1688 | crates/image/lib/registry/client.rs:1832-1842 \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 \u0060crates/image/lib/registry/client.rs:1676\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/registry/client.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e3d6eb1d2bd6517af85cfd55eff43a7f049414097442e8741c1e94a33b15a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/image/lib/registry/client.rs:1704-1716 | crates/image/lib/registry/client.rs:1858-1870 \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 \u0060crates/image/lib/registry/client.rs:1704\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":"crates/image/lib/registry/client.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7c9076652455806f2a6da5b9904c3035bd23cd8c0b01c4b262e6ec48c7349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/image/lib/storage_lease.rs:502-514 | crates/image/lib/storage_lease.rs:868-879 \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 \u0060crates/image/lib/storage_lease.rs:868\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/image/lib/storage_lease.rs:867\u0060 calls \u0060open\u0060 and \u0060crates/image/lib/storage_lease.rs:501\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":"crates/image/lib/storage_lease.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d5e11dd0a1d95aa403760c653d275372b87835560f61a352098c761f22a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/image/lib/tar/ingest.rs:440-452 | crates/image/lib/tar/ingest.rs:455-465 \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 \u0060crates/image/lib/tar/ingest.rs:440\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":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bf3e6b06caab4d9cc687ed6d012ba609b1e91044bac06287c3033e94221460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/metrics/lib/compatibility.rs:256-268 | crates/metrics/lib/registry.rs:1001-1013 \u2014 before extracting anything, compare \u0060crates/metrics/lib/compatibility.rs\u0060 and \u0060crates/metrics/lib/registry.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics/lib/compatibility.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d08fd4418dfb88968aee9a9df83f3ff527dde07d367235acc4e1abb4d904f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/network/lib/engine/icmp/relay.rs:390-402 | crates/network/lib/engine/icmp/relay.rs:444-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/icmp/relay.rs:390\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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e687529a6d02b9606e57d47f38d0e28e3f89c1f5ae2b876e3ce31cc5f684b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/protocol/lib/codec.rs:72-84 | crates/protocol/lib/codec.rs:185-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/lib/codec.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e77ee8607c95e345d7cd486b00a7274f04efc72f64293130e09941494bb3602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/runtime/lib/checkpoint/migration/source.rs:1009-1021 | crates/runtime/lib/checkpoint/migration/source.rs:1183-1195 \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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b984a6623dfef666c6427b1ebef61cbb772fe63cd45170742c7939d9b8b1e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/runtime/lib/client/maintenance.rs:506-518 | crates/runtime/lib/client/maintenance.rs:731-743 \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 \u0060crates/runtime/lib/client/maintenance.rs:506\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1140cb6222bf62f11bfb433c733ba8970e959ad3e507f379552598be9c7e42d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/runtime/lib/runner/jobs.rs:788-800 | crates/runtime/lib/runner/startup.rs:62-73 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/lib/runner/startup.rs:61\u0060 calls \u0060default\u0060 and \u0060crates/runtime/lib/runner/jobs.rs:787\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a41b2ae7c999a3c2f9fc088937848cb5b219cc3867e354cbdbc3dfa1b14a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/microsandbox-types/rust/lib/cloud/secrets.rs:203-215 | packages/microsandbox-types/rust/lib/cloud/secrets.rs:223-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 \u0060packages/microsandbox-types/rust/lib/cloud/secrets.rs:203\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060entry\u0060 to \u0060SecretEntry\u0060 in one and \u0060CloudSecretEntry\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/cloud/secrets.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c78c1dbc42cf8de8453cae6a1960cb6446270441ddf4106abebf5231897fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/go/native/src/lib.rs:4097-4109 | sdk/go/native/src/lib.rs:4148-4160 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752012bb7f9466027a20da84a02154d081cd85bbf095168f81fbe2bfafacbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:1357-1369 | sdk/python/src/sandbox.rs:1825-1837 \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 \u0060sdk/node-ts/native/sandbox.rs:1357\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cdbbaf667be6792a4100e612a4388fc5f335ffdbfe43df118a771cdf1f6ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/python/src/error.rs:166-178 | sdk/ruby/ext/microsandbox/src/lib.rs:407-419 \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":"sdk/python/src/error.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faad071551e22ac34e90120d9eb7fb47bb35b5fafb2398768066a514a64799e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1029-1041 | sdk/rust/lib/backend/local/snapshot/archive.rs:1133-1145 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1029\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c43f3286f5bc611f679d28a0342447bb790ba643681f0a3659c83cf00ab164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:1223-1235 | sdk/rust/lib/backend/local/snapshot/archive.rs:1375-1387 \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, \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1222\u0060 calls \u0060as_file\u0060, \u0060expect\u0060 and \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:1374\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1420e760b816fbe503e7761084a38445f3086905c2ec1ba1c8753c19ee69b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/downgrade.rs:464-476 | sdk/rust/lib/backend/local/snapshot/migration.rs:103-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda7dc91c152543ced97d929cdf5a831eabfacf56b3e34fbd34a776a0d5ccff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/logs/mod.rs:253-265 | sdk/rust/lib/logs/mod.rs:303-315 \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":"sdk/rust/lib/logs/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d50abb847fc5c63709d940ba5387983fa94fa3270ad30fd309d625e7a90959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/runtime/storage_aliases.rs:364-376 | sdk/rust/lib/runtime/storage_aliases.rs:483-495 \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 \u0060sdk/rust/lib/runtime/storage_aliases.rs:364\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":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c434459529c88b3b00405ffa6d6d7c786b497cc32665b1daf02bdd9a44d6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): crates/filesystem/lib/backends/dualfs/create_ops.rs:430-441 | crates/filesystem/lib/backends/dualfs/create_ops.rs:501-512 | crates/filesystem/lib/backends/dualfs/lookup.rs:593-604 | crates/filesystem/lib/backends/dualfs/lookup.rs:663-674 | crates/filesystem/lib/backends/dualfs/lookup.rs:767-778 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a400c61de0da01b6da6510f231d847f34eb0801790cebf1da2a07ff44a14bf9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/create_ops.rs:56-67 | crates/filesystem/lib/backends/dualfs/create_ops.rs:186-196 | crates/filesystem/lib/backends/dualfs/lookup.rs:74-85 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:56\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb52da7372fcfab859790e0c98943600dcb2cc8cb8ab0e31d080646c9a35a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/metadata.rs:161-172 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:81-91 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:119-129 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/metadata.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"be63a51159bf601ba804efc1bce65d47cc8801a6681eeccb17c8409aa847d0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:334-344 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:37-48 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:163-173 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aec99dbf3f910a73a2780ca6e863df693aea066f08e909634c0fa6ecf35ff14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:59-70 | crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:87-98 | crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:155-166 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a29f69c4ecf18d993657960704fe67e3db70b5c935ff8fef303ae431678973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/image/lib/checkpoint/admitted_disk.rs:173-184 | crates/runtime/lib/checkpoint/additional_disk.rs:357-368 | crates/runtime/lib/checkpoint/local_disk.rs:209-220 \u2014 before extracting anything, compare \u0060crates/image/lib/checkpoint/admitted_disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/additional_disk.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/checkpoint/admitted_disk.rs:173\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":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0daa03186e9109c35fbf0ce8ffc353334ef8ed251e3c459b7924599632be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): sdk/go/native/src/lib.rs:2244-2255 | sdk/node-ts/native/mount_builder.rs:192-203 | sdk/python/src/helpers.rs:1096-1107 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8fdb9aee6a062f006e36846372ca191388d1bc3feb4985c5a6d72f943fdea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): sdk/go/native/src/lib.rs:2712-2723 | sdk/go/native/src/lib.rs:2910-2921 | sdk/go/native/src/lib.rs:2949-2960 \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 \u0060sdk/go/native/src/lib.rs:2712\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b6096e2991a3accae90ef22dfef5abbc0ee83429e0a35d9aa6c163339a06d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): sdk/go/native/src/lib.rs:5784-5795 | sdk/go/native/src/lib.rs:6013-6021 | sdk/go/native/src/lib.rs:6049-6057 \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 \u0060sdk/go/native/src/lib.rs:5784\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5784}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50d14c4bb998972d0da052ab5b02849bfecd6ab42d41ca240155aa104e99ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/archive.rs:428-439 | sdk/rust/lib/backend/local/snapshot/archive.rs:467-478 | sdk/rust/lib/backend/local/snapshot/archive.rs:545-556 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:442\u0060 calls \u0060external_bind_guest_paths\u0060 and \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:480\u0060 does not \u2014 after which the two agree again for 3 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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5e5389a5033d52ba91606dbb370fb922bfc976f39f276cc98f7d19e7552527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/agentd/lib/config.rs:343-354 | crates/agentd/lib/config.rs:358-369 \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 \u0060crates/agentd/lib/config.rs:343\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/config.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbe0e25151be12230ecb1be17fc96e92120c20f03a5f55d1312a85619e926d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/cli/lib/commands/image.rs:275-286 | crates/cli/lib/commands/image.rs:627-635 \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 \u0060crates/cli/lib/commands/image.rs:275\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7aa82e3becf4663ca53bf4c0e491b6623356a14d9e0aef0738164e0084d1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/lib/commands/image.rs:502-513 | sdk/go/native/src/lib.rs:6348-6359 \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":"crates/cli/lib/commands/image.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab6963cb832a8cbcce952f42fc19be442da12beef9ccd3e09c7b03dc0327d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/lib/sandbox_config.rs:1044-1055 | crates/cli/lib/sandbox_config.rs:1058-1069 \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 \u0060crates/cli/lib/sandbox_config.rs:1044\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060\u0026mut SandboxConfigInput\u0060 in one and \u0060\u0026mut FilesystemConfigInput\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124162b416f20548c1361dc49daf143945be8074cf2aa982b82c7df18bb192f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/metadata.rs:57-68 | crates/filesystem/lib/backends/dualfs/metadata.rs:178-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/metadata.rs:57\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/metadata.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68cee280e882b4d54e17be72b75eb0d3745ccd1ea3dbb8fdba847bb510d4eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/filesystem/lib/backends/memfs/remove_ops.rs:83-94 | crates/filesystem/lib/backends/memfs/remove_ops.rs:184-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/remove_ops.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa17fc39515df1c22a111392fe2adba0e33909aab3ee9fdd92b79c1514ab9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/windows/memory_mapping.rs:94-105 | crates/filesystem/lib/backends/passthroughfs/windows/memory_mapping.rs:159-170 \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 \u0060crates/filesystem/lib/backends/passthroughfs/windows/memory_mapping.rs:94\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/memory_mapping.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e999e3612695eb1bf674c5cb4ca843c0ff5cb31960db5cbbeb9dfc482c34566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/windows/mod.rs:676-687 | crates/runtime/lib/runner/bootstrap_fs.rs:596-607 \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":"crates/filesystem/lib/backends/passthroughfs/windows/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71d3f8d879fbeb04737eb1c8844a3a96b22bfd6c6882fcea1930d6bc98a122e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/async_gate.rs:71-82 | crates/image/lib/async_gate.rs:92-103 \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 \u0060crates/image/lib/async_gate.rs:71\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/async_gate.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1417d0625ddeac0495e7b24976cbb36e9fe18ee52b9aece454c46cc7ffabe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/async_gate.rs:132-143 | crates/image/lib/storage_lease.rs:316-327 \u2014 before extracting anything, compare \u0060crates/image/lib/async_gate.rs\u0060 and \u0060crates/image/lib/storage_lease.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/image/lib/async_gate.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f392676dee93fd083a4eba46b9f23ec38a2f099111c30ef26d108a593855c3e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/checkpoint/resolver.rs:369-380 | crates/image/lib/checkpoint/store.rs:196-207 \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 \u0060crates/image/lib/checkpoint/resolver.rs:369\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":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd1ff63acc8ad7dcb3480e11f3e5365a55b14d09e6091a17e9793d6372bf424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:736-747 | crates/image/lib/erofs/writer.rs:1075-1086 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:736\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04e68e8d2ff09c44bfb9a0751f4475ed606c377fc714af2bff8257a929a5e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/ext4/formatter.rs:996-1007 | crates/image/lib/ext4/formatter.rs:1019-1030 \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 \u0060crates/image/lib/ext4/formatter.rs:996\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5c65432d33f6ddf1fa6ca3bf840e854f239a35186e04c61f5ba3c6aa0cc813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/image/lib/layer/download.rs:101-111 | crates/image/lib/layer/download.rs:138-149 \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 \u0060crates/image/lib/layer/download.rs:101\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":"crates/image/lib/layer/download.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc9ed8993152d0dedc2cce49ac07ff1f4aa0ac699ef5faf3f50c646adf3986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/layer/download.rs:162-173 | crates/image/lib/layer/download.rs:193-204 \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 \u0060crates/image/lib/layer/download.rs:162\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":"crates/image/lib/layer/download.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1c928cbeb317465e9c585168c771233f57babf635d26240ea9898b813bb0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): crates/image/lib/registry/client.rs:253-259 | crates/image/lib/registry/client.rs:607-618 \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 \u0060crates/image/lib/registry/client.rs:253\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/registry/client.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"656538bdc2229db4c8bd445fd2bcc18231b5fdadc47247f7cba9a2dcbb720738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/snapshot/migration.rs:240-251 | crates/image/lib/snapshot/migration.rs:430-441 \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":"crates/image/lib/snapshot/migration.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d6c664d05559a156e65997fa85469ece232aaf71c7090353651a63de07ddcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/image/lib/storage_lease.rs:245-256 | crates/image/lib/storage_lease.rs:265-276 \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 \u0060crates/image/lib/storage_lease.rs:245\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/storage_lease.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebc8798dab9b408d8fb7650069b25e160419404e4f47417772b513efb95380c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs:45-56 | crates/migration/lib/m20260710_000001_migrate_root_disk.rs:72-83 \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 \u0060crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs:45\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":"crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e2d0ed6a63044a6731e92e54f71c94b5591e7fc8f2073736360729ee59b195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:37-48 | crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:75-86 \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 \u0060crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs:37\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":"crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02ab2df7205691e8a17af6981b6f006ab143ce4d89e76f7be35ea3aae36e41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/migration/lib/m20260710_000001_migrate_root_disk.rs:66-77 | crates/migration/lib/m20260710_000001_migrate_root_disk.rs:95-106 \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 \u0060crates/migration/lib/m20260710_000001_migrate_root_disk.rs:66\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":"crates/migration/lib/m20260710_000001_migrate_root_disk.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1dccf72200adad4034f2914fc2ab1d02a81cd92481fb42fcee966673c38582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/network/lib/engine/secrets/handler.rs:1072-1083 | crates/network/lib/engine/secrets/handler.rs:1515-1523 \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 \u0060crates/network/lib/engine/secrets/handler.rs:1072\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c18100f0c1308b1b4d68aecb7e1155b230e9b0acf8a8f95355ba338fbb6aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/network/lib/engine/secrets/handler.rs:1272-1283 | crates/network/lib/engine/secrets/handler.rs:1397-1408 \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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"77124fd0c733377042642d421e618ff33b375e778f711073ae4f8df8cad1c944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/network/lib/engine/secrets/handler.rs:1707-1718 | crates/network/lib/engine/secrets/handler.rs:1722-1733 \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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b12e8e16c535c8978bc0aa2290d7b8e74ebeea44291baf2302d7998ee31c536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/network/lib/engine/tcp/proxy.rs:452-463 | crates/network/lib/engine/tcp/proxy.rs:524-535 \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 \u0060crates/network/lib/engine/tcp/proxy.rs:452\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf41f98c13ddb906798b5ebd814da3334b372a35381287439a4151ae33c4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/runtime/lib/checkpoint/memory_cache.rs:232-243 | crates/runtime/lib/checkpoint/memory_cache.rs:254-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/memory_cache.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b258d3f836bbdf1828af89398cc5bff9c2d8573cf3a2c0aa5245f1ed101ccf5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/runtime/lib/runner/relay.rs:4287-4298 | crates/runtime/lib/runner/relay.rs:4422-4433 \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 \u0060crates/runtime/lib/runner/relay.rs:4287\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd060f82c7f81aadefe5e75472b9d1f425bcc34b123414623bbfc722695efbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:518-529 | packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:534-545 \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 \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:518\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":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a79e5b621b2fd323d4f18f03bc3238784560bc1c665cafc3a0d2d5798cf8c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/go/native/src/lib.rs:1599-1610 | sdk/python/src/helpers.rs:1733-1744 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"64126a7ebc3b2905a3ac53f587d6ebc51d9e11905c2f3e377137c45ed7900582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/go/native/src/lib.rs:7756-7767 | sdk/go/native/src/lib.rs:7833-7844 \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 \u0060sdk/go/native/src/lib.rs:7756\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f139dab85af983059c75c95f63f5d3b963b7819a7b763a389757edb0614956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/node-ts/native/restore_builder.rs:237-248 | sdk/node-ts/native/sandbox_builder.rs:235-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b389548f29ce52d65a7a43d9358adbecf385a1e5add8dca49c9c81e41d87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:675-686 | sdk/node-ts/native/sandbox_handle.rs:283-294 \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 \u0060sdk/node-ts/native/sandbox.rs:675\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/node-ts/native/sandbox.rs:672\u0060 calls \u0060get\u0060, \u0060ok_or_else\u0060, \u0060fork\u0060 and \u0060sdk/node-ts/native/sandbox_handle.rs:281\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ec0b519ed1295f91bf31c5d487ee54e3524b944ea253f2efc5b57898b5fb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/python/src/sandbox.rs:1271-1282 | sdk/python/src/sandbox_handle.rs:490-501 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1271\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4363091bf1873b995ea636c6901a9b7cc4c5f4e5db59ff2c9c78965227a0922d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:4394-4405 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1520-1531 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:4394\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1910d4a30baba953090adce0a70d09066992810a1d7ce9bd1e5f0f7078706801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): sdk/rust/lib/backend/local/volume.rs:290-301 | sdk/rust/lib/volume/mod.rs:630-638 \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 \u0060sdk/rust/lib/backend/local/volume.rs:290\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/volume.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b902c969c04ad959cb1d8d3414276e405bf2d510286f1c86afb87244e56e2b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/rust/lib/runtime/spawn.rs:1463-1474 | sdk/rust/lib/runtime/spawn.rs:1487-1498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/runtime/spawn.rs:1463\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6b65a30ebf0f68c692a438f9fcdc2fa2b39ff8b576b27c1d4df173a61f7ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:179-188 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:240-249 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:333-342 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:36-46 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:162-171 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eabdb84e3c978a3320322558329a74754a5dc69b55574f3a99baa6f7b9532b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:261-271 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:830-840 | crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:835-845 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:428-438 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:261\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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"98105afaad5d8ba0154b48f2f82416212b1360f9199be5d5f7c59630ea7f0e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/create_ops.rs:74-84 | crates/filesystem/lib/backends/dualfs/create_ops.rs:283-289 | crates/filesystem/lib/backends/dualfs/create_ops.rs:344-350 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8881de3499c928ecdc2eae07cec1599ca3b70e81ee00ed5a326002aeb9f56620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/file_ops.rs:69-79 | crates/filesystem/lib/backends/dualfs/lookup.rs:85-94 | crates/filesystem/lib/backends/dualfs/metadata.rs:126-136 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/metadata.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:69\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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a1314b0a7cd3fc802ca776b76eaa7b0a02080b83ac4d5062590a1791c2765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/remove_ops.rs:79-89 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:197-207 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:440-449 \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 \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:450\u0060 calls \u0060mark_metadata_authority\u0060 and \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:92\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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8be5011a6621c4142ba80c9979940825a02bf59efe7eec0ed326d99810182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/agentd/lib/agent.rs:756-766 | crates/agentd/lib/agent.rs:869-879 \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 \u0060crates/agentd/lib/agent.rs:756\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"b969be01f664667d47be66a227a254dd48fd137df5b24e3a29d7b11f667e8be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/agentd/lib/process.rs:505-515 | crates/agentd/lib/process.rs:519-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agentd/lib/process.rs:505\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":"crates/agentd/lib/process.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"94713dedc21fc2c21d00227de7848b9e194edba36fea6915d2d1e5b4a7be8178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/cli/lib/commands/modify.rs:143-152 | sdk/go/native/src/lib.rs:3410-3420 \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 \u0060crates/cli/lib/commands/modify.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"076bb832cf28960de3f0bd75ea9dfe1202e7fb7b7de22d2bbc476866b564c1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/lib/tree.rs:121-131 | crates/cli/lib/tree.rs:387-397 \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 \u0060crates/cli/lib/tree.rs:121\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":"crates/cli/lib/tree.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b260d8382545dbbaf019773dbba8d300ece97710569383b791ed55553598e529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/remove_ops.rs:26-36 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:137-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/remove_ops.rs:26\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":"crates/filesystem/lib/backends/dualfs/remove_ops.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b550987b206f6db9db35c2184e8685b7a09c2a39a6f6df50a0b594d76f30fd40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/builder.rs:64-74 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:567-577 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/passthroughfs/unix/builder.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/builder.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d459c2a164774d014d3d34efcafe30fd6185e54d0d0fbc1d1973a1bde341019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/builder.rs:241-251 | crates/filesystem/lib/backends/passthroughfs/unix/mod.rs:404-414 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/passthroughfs/unix/builder.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/unix/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/builder.rs:241\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":"crates/filesystem/lib/backends/passthroughfs/unix/builder.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0907f732124102b9be171fa1ecd65d34f7177ebda18b8487357b7f595a1fccd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:434-444 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:450-460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d688e354afffb0f55ca02617ac22b0191734a6e2d67d00a2905d878b0a21e096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:615-622 | crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:1128-1138 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/inode.rs:615\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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"052d9154039a4c0e7ed5ef6c76465e703953aa7dac6a4923d041e4919070aa7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:102-117 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:200-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:102\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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e429bd06541d7773bb0d1130ea15a709e0f8159061d7a11c469b7c8a8d7d2507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/image/lib/archive/docker.rs:940-950 | crates/image/lib/archive/docker.rs:1196-1204 \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 \u0060crates/image/lib/archive/docker.rs:940\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08a0cb2ab88ab986dc3ac576d78b8305e99aa07de62e5a74cecb353c089eafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:555-565 | crates/image/lib/erofs/writer.rs:878-888 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:555\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b12bc93cdc13eb348cd67cc815aa39132cf2e6787f47634bfca4c823b7cee84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/image/lib/ext4/rootfs.rs:164-174 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1507-1517 \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 \u0060crates/image/lib/ext4/rootfs.rs:164\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":"crates/image/lib/ext4/rootfs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887cebcd06c0f6a5eb4f9ebd30d796b40d10206aee9b2a4cd5c584ac27ece16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/image/lib/layer/download.rs:131-141 | crates/image/lib/layer/download.rs:269-279 \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 \u0060crates/image/lib/layer/download.rs:131\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":"crates/image/lib/layer/download.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1edb2140ac690110b124ab591c8f0fd749a67d916f94a12d0e9e86fa3fef7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/checkpoint/coordinator.rs:1789-1799 | crates/runtime/lib/checkpoint/coordinator.rs:1830-1840 \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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6148c435bffb915122043d3a620f109b6f7369c5995c1cccb8de6639ab5678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:299-309 | crates/runtime/lib/checkpoint/owned_disk.rs:361-371 \u2014 before extracting anything, compare \u0060crates/runtime/lib/checkpoint/disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/owned_disk.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/checkpoint/disk.rs:299\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 after the matched lines, \u0060crates/runtime/lib/checkpoint/owned_disk.rs:374\u0060 calls \u0060clone\u0060 and \u0060crates/runtime/lib/checkpoint/disk.rs:311\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d8d0eabd4d7e27d3cc4a7395021c0017d1cee694a0d7272211acde80dfda77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:441-451 | crates/runtime/lib/checkpoint/disk.rs:614-624 \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 \u0060crates/runtime/lib/checkpoint/disk.rs:441\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d3a5c122c2ee12e8c417387094ba807a5c49e0d974f9a0e549b9506a707c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/checkpoint/layout.rs:210-220 | crates/runtime/lib/checkpoint/layout.rs:227-237 \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 \u0060crates/runtime/lib/checkpoint/layout.rs:210\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":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4871bb550871744fbbd9916b9dbbb825d5b45854a4744842def4bdcc1dc5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/client/ipc.rs:110-120 | crates/runtime/lib/client/ipc.rs:491-501 \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 \u0060crates/runtime/lib/client/ipc.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4acb2d84f34fcbc2be7a970169bad54570b7f3b3936cb405acefaa3cc764148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2239-2249 | crates/runtime/lib/runner/vm.rs:2380-2388 \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 \u0060crates/runtime/lib/runner/vm.rs:2239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf2297659c36ffead51fdc30c503560369a024b3f30934f3896bf8e69619b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/microsandbox-types/rust/lib/domain.rs:2178-2188 | packages/microsandbox-types/rust/lib/domain.rs:2194-2204 \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":"packages/microsandbox-types/rust/lib/domain.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"439be089c525d4d9225a5d311c00149a397dfa4a8949ec4c6290a4b5c62d5d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/go/native/src/lib.rs:4290-4300 | sdk/node-ts/native/ssh.rs:247-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:4290\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a00cf0e85401118b29d677b57151216b4d5d4e988ba189230468992759fb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:121-131 | sdk/node-ts/native/exec_options_builder.rs:199-209 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3100ac642dee8472b3b5243a975c346b21e0c012ca6258adae7bb7126d4aa2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): sdk/node-ts/native/attach_options_builder.rs:136-146 | sdk/node-ts/native/exec_options_builder.rs:214-224 | sdk/node-ts/native/sandbox_builder.rs:719-722 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/node-ts/native/attach_options_builder.rs:136\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. 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 before the matched lines, \u0060sdk/node-ts/native/attach_options_builder.rs:135\u0060 calls \u0060safe_integer\u0060 and \u0060sdk/node-ts/native/sandbox_builder.rs:718\u0060 does not \u2014 after which the two agree again for 3 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":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f713fd48dfbab799d124b85c922abbb982162ad7e359feb92bb83e28c778fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/node-ts/native/mount_builder.rs:428-438 | sdk/node-ts/native/mount_builder.rs:557-567 \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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4dbedebb84d91d028d1b22bde9ab23a7cb575a89b48c6c6b5203c6404b19c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/python/src/jobs.rs:167-177 | sdk/python/src/jobs.rs:198-208 \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 \u0060sdk/python/src/jobs.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/python/src/jobs.rs:195\u0060 calls \u0060unwrap_or_default\u0060 and \u0060sdk/python/src/jobs.rs:166\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":"sdk/python/src/jobs.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca07a6ca559eaf6c7225cd3a643b02ea3f9f5fd27c6827fddd4ee205eddfbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/python/src/sandbox.rs:1320-1330 | sdk/python/src/sandbox_handle.rs:540-550 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1320\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"04454a4d54df372a2c09b75dd83a82983f94e7080f0f6d9b1777b99d8b3ecd81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/python/src/volume.rs:219-229 | sdk/python/src/volume.rs:257-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/volume.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae34c5a641987b3078a6849f533d3afb45c1309e4ea249f9d32f5acf04401806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/rust/lib/backend/cloud/volume.rs:521-531 | sdk/rust/lib/backend/cloud/volume.rs:536-546 \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":"sdk/rust/lib/backend/cloud/volume.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa58106699839867cb56d108bc9cd77a9a28bdeada17b26f06a81ab9d25962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/downgrade.rs:807-817 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1385-1393 \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 \u0060sdk/rust/lib/backend/local/snapshot/downgrade.rs:807\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060candidates\u0060 to \u0060\u0026mut [Candidate]\u0060 in one and \u0060\u0026mut [ReleasedFlatCandidate]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"29780df301044f749c770b015ab7866b4ea8f4ac60847b3a80aa11f10d6508fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/filesystem/lib/backends/dualfs/create_ops.rs:276-285 | crates/filesystem/lib/backends/dualfs/create_ops.rs:337-346 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:39-48 | crates/filesystem/lib/backends/dualfs/remove_ops.rs:149-158 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:276\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4647559f94d2dd82391685c1c806b8951ac1a6cdbd141a9cc5219bc9fa30f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/image/lib/checkpoint/admitted_disk.rs:143-152 | crates/runtime/lib/checkpoint/layout.rs:447-456 | crates/runtime/lib/checkpoint/local_disk.rs:175-184 | crates/runtime/lib/checkpoint/memory_cache.rs:501-510 \u2014 before extracting anything, compare \u0060crates/image/lib/checkpoint/admitted_disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/local_disk.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/checkpoint/admitted_disk.rs:143\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":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10c8190ba4e6a1e3778b582d24c6467e12801e247005c0fc7919e4c41ef8f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/image/lib/checkpoint/admitted_disk.rs:171-180 | crates/runtime/lib/checkpoint/additional_disk.rs:355-364 | crates/runtime/lib/checkpoint/local_disk.rs:207-216 | crates/runtime/lib/checkpoint/memory_cache.rs:535-543 \u2014 before extracting anything, compare \u0060crates/image/lib/checkpoint/admitted_disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/additional_disk.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/checkpoint/admitted_disk.rs:171\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":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d8cfcfa2ab0786d679f5c2a73ae7f5a1113cfc7eba0e0fd1886cf966fc01ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): sdk/go/native/src/lib.rs:2712-2720 | sdk/go/native/src/lib.rs:2910-2918 | sdk/go/native/src/lib.rs:2949-2957 | sdk/go/native/src/lib.rs:3019-3028 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8426eab83df95f8361a81d6cf3694ea86ae14996a801f36960170032619afd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/archive.rs:889-898 | sdk/rust/lib/backend/local/snapshot/archive.rs:1016-1025 | sdk/rust/lib/backend/local/snapshot/archive.rs:1120-1129 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive.rs:889\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc25b98e05fa42d37cbe9190e26ba89dbdd413ebb5f0a5305659fc0537b3249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/agentd/lib/fs.rs:903-912 | crates/agentd/lib/fs.rs:1594-1603 \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 \u0060crates/agentd/lib/fs.rs:903\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":"crates/agentd/lib/fs.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce7219b107e04196389d9424adbf5bce2cec3db268629798055ba976ee6f26d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/lib/commands/copy.rs:652-661 | crates/cli/lib/commands/copy.rs:672-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"f844e8af43908ff126c1cd65d964790b691d742927b6dbaca590be330cad9c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/lib/commands/copy/host_windows.rs:337-346 | sdk/rust/lib/sandbox/patch.rs:1915-1924 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/copy/host_windows.rs\u0060 and \u0060sdk/rust/lib/sandbox/patch.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/copy/host_windows.rs:337\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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15361e309a0d00d55ae36332eb3fae55eb8f77c72f5d993213d5200fa8243d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/lib/commands/copy/host_windows.rs:399-408 | sdk/rust/lib/sandbox/patch.rs:1885-1894 \u2014 before extracting anything, compare \u0060crates/cli/lib/commands/copy/host_windows.rs\u0060 and \u0060sdk/rust/lib/sandbox/patch.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/copy/host_windows.rs:399\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":"crates/cli/lib/commands/copy/host_windows.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"259a6ae7523da887a3d9c13f0127b7f55312da2be0141b54c9ce81f28f0aacd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/lib/commands/install.rs:317-326 | crates/cli/lib/commands/install.rs:362-371 \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 \u0060crates/cli/lib/commands/install.rs:317\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":"crates/cli/lib/commands/install.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f6804339eb30a39434408d8c1f1827074e76295dc1b819d54c6f904c9a51d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/create_ops.rs:480-489 | crates/filesystem/lib/backends/dualfs/lookup.rs:643-652 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:480\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4835b53ca62874c6246fb3c06ed84e163a7bcee0d0dd45769fee413b13e921f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): crates/filesystem/lib/backends/memfs/create_ops.rs:91-94 | crates/filesystem/lib/backends/memfs/create_ops.rs:270-279 | crates/filesystem/lib/backends/memfs/create_ops.rs:339-348 \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 \u0060crates/filesystem/lib/backends/memfs/create_ops.rs:270\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":"crates/filesystem/lib/backends/memfs/create_ops.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d988074099ba25be5315e1634a833c2ec8ea1bc6d06d9d32caab3b9756797c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:310-319 | crates/filesystem/lib/backends/passthroughfs/windows/mod.rs:501-510 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs:310\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":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be90e556853a6fc2359e131827b02700e997899223a15742dd7698be69a8e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:176-185 | crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:161-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3205b89db1ec106d53d1430fce37f6b173619b39c74074d746e6b21b9082365a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:85-94 | crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs:80-89 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 44 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c221c1ebca8b3a21755cfc5e0f2c098251fcadca59678275270dc56f1666c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/image/lib/erofs/writer.rs:855-864 | crates/image/lib/erofs/writer.rs:883-892 \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 \u0060crates/image/lib/erofs/writer.rs:855\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":"crates/image/lib/erofs/writer.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c994c2fd94278261266199d52c74b174d2d3803aa2520fdf29a95712533c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/image/lib/storage_lease.rs:665-674 | crates/image/lib/storage_lease.rs:710-719 \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 \u0060crates/image/lib/storage_lease.rs:665\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":"crates/image/lib/storage_lease.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf823dba4a0084bb59d25b250cdf4d6b559adb183294f954dfa3718d75d5985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/migration/lib/m20260305_000001_create_image_tables.rs:324-333 | crates/migration/lib/m20260410_000001_erofs_image_schema.rs:414-423 \u2014 before extracting anything, compare \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs\u0060 and \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/migration/lib/m20260410_000001_erofs_image_schema.rs:412\u0060 calls \u0060drop_table\u0060, \u0060drop\u0060, \u0060table\u0060 and \u0060crates/migration/lib/m20260305_000001_create_image_tables.rs:323\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":"crates/migration/lib/m20260305_000001_create_image_tables.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"336d1cf001077942ce4634e13f7512fd3448ec865e9fc256aa4779d5135d15fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/network/lib/engine/udp/fragments.rs:238-247 | crates/network/lib/engine/udp/fragments.rs:308-317 \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":"crates/network/lib/engine/udp/fragments.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3153b36ff1857075894c8036a5ac1d715b24e0865f6cdd379f912f63c99701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/network/lib/engine/udp/relay.rs:1004-1013 | crates/network/lib/engine/udp/relay.rs:1027-1036 \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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"102cc5d045ed6ce91f01769ec17c19d35aa04f303e8e5738b0e781538dd769af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/lib/runner/cpu/planner.rs:414-423 | crates/runtime/lib/runner/cpu/planner.rs:490-499 \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 \u0060crates/runtime/lib/runner/cpu/planner.rs:414\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":"crates/runtime/lib/runner/cpu/planner.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4e9a45c26212d50089033745e89ee445f4dc6fd2e465707c69470ceeba240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/lib/runner/jobs.rs:347-356 | sdk/rust/lib/sandbox/jobs/client.rs:405-414 \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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00907ca5e15d1eff673c83c5c746b83a6705d6379bded81000ccfad6a1e69ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/lib/runner/metrics.rs:371-380 | crates/utils/lib/extent.rs:108-117 \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 \u0060crates/runtime/lib/runner/metrics.rs:371\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":"crates/runtime/lib/runner/metrics.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c35c0095d8e3e51e3646748c28bbce09fa9a0d5740fa2d9f5bb694a96601e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2602-2611 | crates/runtime/lib/runner/vm.rs:2656-2665 \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 \u0060crates/runtime/lib/runner/vm.rs:2602\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c457dab25b527d287a1c295175dd06b5c27a56f4430b3f68ee695363c887323d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:3344-3353 | crates/runtime/lib/runner/vm.rs:3367-3376 \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 \u0060crates/runtime/lib/runner/vm.rs:3344\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff243b29047b79124b3f56d3fd5ccbe8a3ec329c7b7539e58a9280172689aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/go/native/src/lib.rs:4297-4306 | sdk/go/native/src/lib.rs:4343-4352 \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 \u0060sdk/go/native/src/lib.rs:4297\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":4297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf30c5e041fb66ac8e93f564fc1e2152ddac6d1d653021d0246744b27b52ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/node-ts/native/sandbox_handle.rs:280-289 | sdk/node-ts/native/sandbox_handle.rs:313-322 \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 \u0060sdk/node-ts/native/sandbox_handle.rs:280\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":"sdk/node-ts/native/sandbox_handle.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f6d272d7a5d84c826f9b19a8182ac039276f1d664309bd092f4b931667488f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sdk/python/src/helpers.rs:2255-2272 | sdk/python/src/helpers.rs:2278-2295 \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":"sdk/python/src/helpers.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f18142b4fd3d95471f05d5ead621b1ecf5873ca84bc5bfc335181966b27cd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/python/src/image.rs:200-209 | sdk/python/src/image.rs:387-396 \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 \u0060sdk/python/src/image.rs:387\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":"sdk/python/src/image.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4320b518acd7a19b9a0ad52c45001d8ec4b4e831eddf055b0b23d03d5bdbf276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/python/src/sandbox.rs:498-508 | sdk/ruby/ext/microsandbox/src/lib.rs:2310-2319 \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 \u0060sdk/python/src/sandbox.rs:498\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. 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":"sdk/python/src/sandbox.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bd0fcf94b37b4a3992ed5940d6855837f3b7e133637eff436510452d7159fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/python/src/sandbox.rs:1436-1445 | sdk/python/src/sandbox_handle.rs:632-641 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1436\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb354b3cabcf712bc0e6facfa673c0ed46052ed74379428add5075d8dbf7d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/rust/lib/backend/local/database.rs:117-126 | sdk/rust/lib/backend/local/database.rs:148-157 \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":"sdk/rust/lib/backend/local/database.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5da811c2eb7fbec09fbb2949c9f24d72bd58d5848edd6ee7ae0c08d06e93c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/downgrade.rs:453-462 | sdk/rust/lib/backend/local/snapshot/migration.rs:742-751 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"69212f2bb11fb57598a186f436c6dd4fe4f8e160c1a52381694eeff7fac83941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/group.rs:862-870 | sdk/rust/lib/backend/local/snapshot/verify.rs:275-284 \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 \u0060sdk/rust/lib/backend/local/snapshot/group.rs:862\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/group.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a11f4adf7794cdb4be32f37daf31c9e7b90ae9d3ee2a4061d0347b7c1c04e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/metadata.rs:110-119 | sdk/rust/lib/backend/local/snapshot/metadata.rs:153-162 \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 \u0060sdk/rust/lib/backend/local/snapshot/metadata.rs:110\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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec33038054f880e5fb958ecf4949ba522c7ded0e7fe6b85a5b6ca75c5c63643f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/rust/lib/runtime/handle.rs:470-479 | sdk/rust/lib/runtime/handle.rs:618-627 \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 \u0060sdk/rust/lib/runtime/handle.rs:470\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":"sdk/rust/lib/runtime/handle.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"649eb08a9d0a8a1aac4ab54a822f63af0192ea4db30ac4f107cde028cbc99a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): sdk/go/native/src/lib.rs:5896-5904 | sdk/go/native/src/lib.rs:5924-5932 | sdk/go/native/src/lib.rs:5963-5971 | sdk/go/native/src/lib.rs:6088-6096 | sdk/go/native/src/lib.rs:7325-7333 | sdk/go/native/src/lib.rs:7359-7367 \u2014 all 6 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 \u0060sdk/go/native/src/lib.rs:5896\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5896}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f63d1565c3cf4d0c084a55340e02a70ab43d9910200d66996b79dd10b9e483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): sdk/go/native/src/lib.rs:2269-2277 | sdk/go/native/src/lib.rs:2391-2399 | sdk/python/src/helpers.rs:1121-1129 | sdk/python/src/helpers.rs:1150-1158 | sdk/python/src/helpers.rs:1214-1222 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/python/src/helpers.rs:1159\u0060 calls \u0060Some\u0060, \u0060quota\u0060 and \u0060sdk/python/src/helpers.rs:1223\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf7dc8fe7faf68b7b6fc4a32508b28d9ae24cdbbf80d1a9f3ee75bf1ea7608b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/filesystem/lib/backends/dualfs/dir_ops.rs:119-127 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:141-148 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:161-168 | crates/filesystem/lib/backends/dualfs/dir_ops.rs:230-237 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffbd03de874341bdce528a99705caf4a13ca5a6acca1b9b77579848df346edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/filesystem/lib/backends/memfs/create_ops.rs:39-47 | crates/filesystem/lib/backends/memfs/create_ops.rs:122-130 | crates/filesystem/lib/backends/memfs/create_ops.rs:199-207 | crates/filesystem/lib/backends/memfs/create_ops.rs:290-298 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/memfs/create_ops.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b53e23df27f979538d42ca65e918085f5a5929a54e2ea4e336f26df40bebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/image/lib/async_gate.rs:69-77 | crates/image/lib/async_gate.rs:90-98 | crates/image/lib/storage_lease.rs:243-251 | crates/image/lib/storage_lease.rs:263-271 \u2014 before extracting anything, compare \u0060crates/image/lib/async_gate.rs\u0060 and \u0060crates/image/lib/storage_lease.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/async_gate.rs:69\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/async_gate.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b4c04037ce07983b84dfc5cbea5c8ea57757b54e55cf552d7b8014889220d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): sdk/go/native/src/lib.rs:5450-5458 | sdk/go/native/src/lib.rs:5612-5620 | sdk/go/native/src/lib.rs:5831-5839 | sdk/go/native/src/lib.rs:7250-7258 \u2014 all 4 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 \u0060sdk/go/native/src/lib.rs:5450\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62ca2083389e2a18267b550b56e70e0d81b7377ca8bc9157a3015aa866b2652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/file_ops.rs:169-177 | crates/filesystem/lib/backends/dualfs/file_ops.rs:267-275 | crates/filesystem/lib/backends/dualfs/special.rs:212-220 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/special.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:169\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"29592b3b110379541258fb46675b41c899e3bb916b4bdbea9fe1463fb9d6dbe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/image/lib/checkpoint/resolver.rs:369-377 | crates/image/lib/checkpoint/store.rs:196-204 | sdk/rust/lib/backend/local/snapshot/verify.rs:535-543 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/resolver.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"394204f530bff31fe3f0a9f976c663012a444e5a3bb5d077f4e4b17cdf8fc2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/image/lib/ext4/rootfs.rs:164-172 | crates/image/lib/snapshot/owned.rs:94-102 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1507-1515 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/rootfs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"25be00a8e8058efa3d8c3eacad1ab6c1bc30aa8b3371db39cf460f0d001e972b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/restore.rs:65-72 | sdk/rust/lib/backend/local/snapshot/restore.rs:183-190 | sdk/rust/lib/backend/local/snapshot/restore.rs:436-444 \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 \u0060sdk/rust/lib/backend/local/snapshot/restore.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/rust/lib/backend/local/snapshot/restore.rs:181\u0060 calls \u0060last\u0060, \u0060clone\u0060 and \u0060sdk/rust/lib/backend/local/snapshot/restore.rs:64\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":"sdk/rust/lib/backend/local/snapshot/restore.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b81e833732c477a9129bf6894afc0e4c8ad9982c21123d58d677a662a4e7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/lib/commands/common.rs:934-942 | crates/cli/lib/commands/common.rs:1197-1205 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7cdbafb57f27812cb72a1a99ec483c28c345cfc954f9f79ba4d555f11856a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/lib/commands/common.rs:2810-2818 | sdk/go/native/src/lib.rs:1611-1619 \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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"261aab5f0f8c8f7645d62cf7891a125c8c394464ec609f91d04868fad5fc224c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/lib/commands/copy.rs:367-376 | crates/cli/lib/commands/copy.rs:417-426 \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 \u0060crates/cli/lib/commands/copy.rs:367\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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"be00771290d9a8636fdf2bdb5686499d09ec2a7a33fa44aee3f6268d66eb6fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/lib/commands/copy.rs:542-552 | crates/cli/lib/commands/copy.rs:581-591 \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 \u0060crates/cli/lib/commands/copy.rs:542\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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59011bd41f68b9f97ad17be3cd107a082dcd181376fb3569a058e6694c518ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/lib/commands/modify.rs:591-599 | sdk/rust/lib/sandbox/modify/local.rs:972-980 \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":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bc5bb67fdbbd3aaec952f2fb8872f26cef7d1dd23b22eac375159ce5b7f1f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/lib/commands/self_cmd.rs:1938-1946 | crates/cli/lib/commands/self_cmd.rs:1959-1967 \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 \u0060crates/cli/lib/commands/self_cmd.rs:1938\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd79118e5adad98b98e5c409f14d8da83f461f0ba8f9a236c96a1d32e0efb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/cli/lib/machine_cmd.rs:420-428 | crates/runtime/lib/client/compat/launch.rs:272-277 \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":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb9d7e405cd7312d2db707e344bfad6c3148ebc859b0248375858ecf0629bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/file_ops.rs:58-66 | crates/filesystem/lib/backends/dualfs/metadata.rs:115-123 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/metadata.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:58\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffdb5e43d97c6393e1a01749b43b5306188ca7119a73f8e15a04e78e5634381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/lookup.rs:653-661 | crates/filesystem/lib/backends/dualfs/lookup.rs:760-765 \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 \u0060crates/filesystem/lib/backends/dualfs/lookup.rs:653\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. 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":"crates/filesystem/lib/backends/dualfs/lookup.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6966a704ffa7c9a4d0b30a7f054f6dd31da40e7a33ec5b22be6a65cec6c35d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:91-100 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:91\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":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9f24b80c7e7750ce07bb0843503c7af4313c78fcd99dc74c9df612c0f0868e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:649-657 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:814-822 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:649\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f431658b65a768167eea654fca23245cf41e72ea003527f6f4e5192df9614bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:727-735 | crates/image/lib/erofs/writer.rs:1060-1068 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/image/lib/erofs/fsmeta.rs:727\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6b11c9cb3f61e122e21decbbea4eeae2975dfc88f6c57a1ebbe04b4880942b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/image/lib/erofs/fsmeta.rs:1039-1044 | crates/image/lib/erofs/writer.rs:1337-1345 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/image/lib/erofs/writer.rs:1349\u0060 calls \u0060write_all\u0060 and \u0060crates/image/lib/erofs/fsmeta.rs:1052\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d947ff1bb5b54ba3dcc516b4b0da6b536d9f6d929fb11703a9c49a6c787a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/runtime/lib/client/memory_handoff.rs:74-82 | crates/runtime/lib/client/memory_handoff.rs:111-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/memory_handoff.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e700a4ca476524e59162e55b90c419f0210fee307110babfea997490b3b36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/runtime/lib/runner/cpu/planner.rs:336-343 | crates/runtime/lib/runner/cpu/planner.rs:374-382 \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 \u0060crates/runtime/lib/runner/cpu/planner.rs:336\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":"crates/runtime/lib/runner/cpu/planner.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3033435e8474299d60d8a858ad25de4424701eb6a45f840dafacb6fc34764d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/runtime/lib/runner/workload_control.rs:206-214 | crates/runtime/lib/runner/workload_control.rs:334-342 \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 \u0060crates/runtime/lib/runner/workload_control.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/workload_control.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac25c7fd0a91b4cf8600d1b38424f9ab8ebed95f855ba7fd30e576f266be74a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/microsandbox-types/rust/lib/secret_plan/input.rs:218-226 | packages/microsandbox-types/rust/lib/secret_plan/input.rs:238-246 \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 \u0060packages/microsandbox-types/rust/lib/secret_plan/input.rs:218\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060entry\u0060 to \u0060\u0026CloudSecretPlanEntry\u0060 in one and \u0060\u0026CloudSecretApplyEntry\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/secret_plan/input.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0556a1f2e965e6217ead2d3f981c45dc4a49d2f51172157de0d66d9b70defce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:493-501 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:591-599 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce03e655735d3aa01e38579b9ead747574678bf0218aa120d115057a6a0d5edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/go/native/src/lib.rs:2641-2649 | sdk/python/src/helpers.rs:674-682 \u2014 before extracting anything, compare \u0060sdk/go/native/src/lib.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:2641\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d9eee448a57d52234fcbce2bdf00200426b4b67a102ad4903009a31dcae345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/go/native/src/lib.rs:4687-4695 | sdk/go/native/src/lib.rs:4763-4771 \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 \u0060sdk/go/native/src/lib.rs:4687\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aff523e35734895e120ed997ef53b68e50b3a117cb7c3617ea22ac877246359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/go/native/src/lib.rs:7731-7739 | sdk/go/native/src/lib.rs:7781-7789 \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 \u0060sdk/go/native/src/lib.rs:7731\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, \u0060sdk/go/native/src/lib.rs:7730\u0060 calls \u0060cstr\u0060, \u0060to_owned\u0060 and \u0060sdk/go/native/src/lib.rs:7780\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68b608155dad4e2d4c530b704df64b29e469474cf20565d2682facee479e62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/node-ts/native/fs.rs:260-268 | sdk/node-ts/native/volume.rs:380-388 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/fs.rs\u0060 and \u0060sdk/node-ts/native/volume.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/node-ts/native/fs.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b1ea8ea6f67f5cc057b00fdc239d68163337a5266257ce9d78f7f2938cd40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:664-672 | sdk/node-ts/native/sandbox.rs:699-707 \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 \u0060sdk/node-ts/native/sandbox.rs:664\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4d6062ba29eaeb9d405ef3b72237d3ba1d74e4b4cf1827d6aa8a9e1bcf6157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:985-993 | sdk/node-ts/native/sandbox.rs:1021-1029 \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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"051eb5c3e693b9aa997fb6c5f29f049d51ec91623b8d628a14959be5a539aa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/python/src/image.rs:215-223 | sdk/python/src/image.rs:402-410 \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 \u0060sdk/python/src/image.rs:402\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":"sdk/python/src/image.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"53874543b41cffe0be0351b0423f28b1c9deee20248047a98d3170217e3501d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/python/src/sandbox.rs:1463-1471 | sdk/python/src/sandbox_handle.rs:658-666 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1463\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cc413d3ac8ac724d8e4b80e28cf4d276ff9f0f3a3a3c3333d2edc45598aecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/python/src/sandbox.rs:2310-2318 | sdk/python/src/sandbox.rs:2368-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060opts\u0060 to \u0060ExecOpts\u0060 in one and \u0060AttachOpts\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox.rs"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d5d867fd81c9cfdb0c8d24842ab51e3483d23480c1c64d515a4546e7471e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/python/src/ssh.rs:78-86 | sdk/python/src/ssh.rs:121-129 \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 \u0060sdk/python/src/ssh.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/ssh.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9f8159459b20efbbd18ec1b841da965e604284ada813d274ab743d398d7a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/cloud/http.rs:531-539 | sdk/rust/lib/backend/cloud/http.rs:546-554 \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 \u0060sdk/rust/lib/backend/cloud/http.rs:531\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":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a4ee3c66f15349954045ec3771c2d2d31baa58a09d9b3e157ba51442d6446b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive.rs:3231-3239 | sdk/rust/lib/backend/local/snapshot/archive.rs:3436-3444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7add209e1779ab6055526a4cc55a21ec89261c59c44795ea12a7215db356dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/downgrade.rs:567-575 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:631-639 \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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9250257f4d7238769e5ca2b118a98df7e409ba7ea98fa11d20d03abacfb21749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/metadata.rs:73-81 | sdk/rust/lib/backend/local/snapshot/metadata.rs:100-108 \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 \u0060sdk/rust/lib/backend/local/snapshot/metadata.rs: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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89ada12996bae281f68f13d5855682081ed9b9fd147b09196bbc76b9295aa71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/metadata.rs:143-151 | sdk/rust/lib/backend/local/snapshot/metadata.rs:181-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/backend/local/snapshot/metadata.rs:143\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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1bfc6f2d1fc40562245ef819a7d2ac72f10a1ec245949ef86f390c0f06621f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/filesystem/lib/backends/dualfs/file_ops.rs:168-175 | crates/filesystem/lib/backends/dualfs/file_ops.rs:266-273 | crates/filesystem/lib/backends/dualfs/file_ops.rs:357-364 | crates/filesystem/lib/backends/dualfs/file_ops.rs:437-444 | crates/filesystem/lib/backends/dualfs/special.rs:116-123 | crates/filesystem/lib/backends/dualfs/special.rs:211-218 | crates/filesystem/lib/backends/dualfs/special.rs:290-297 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/special.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:168\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cb37be55c25d7ebe941c69c9e4de2d4bdb2ee647fca00d48259b87197ff48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): sdk/go/native/src/lib.rs:4550-4557 | sdk/go/native/src/lib.rs:4614-4621 | sdk/go/native/src/lib.rs:4638-4645 | sdk/go/native/src/lib.rs:4662-4669 | sdk/go/native/src/lib.rs:4712-4719 | sdk/go/native/src/lib.rs:4737-4744 \u2014 all 6 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 \u0060sdk/go/native/src/lib.rs:4550\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6addbd496d77ba51987f1a4f1424ab9db0a19174d9cf3cdbb09658a43797321d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 5): crates/image/lib/erofs/fsmeta.rs:523-528 | crates/image/lib/erofs/fsmeta.rs:560-567 | crates/image/lib/erofs/writer.rs:802-807 | crates/image/lib/erofs/writer.rs:855-861 | crates/image/lib/erofs/writer.rs:883-889 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"419f621b4553876bd833882c14d3f211f8742243ac7e6f96cdf1c94cfbb3f813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): sdk/node-ts/native/sandbox.rs:674-681 | sdk/node-ts/native/sandbox.rs:709-716 | sdk/node-ts/native/sandbox_handle.rs:282-289 | sdk/node-ts/native/sandbox_handle.rs:315-322 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/node-ts/native/sandbox.rs:672\u0060 calls \u0060get\u0060, \u0060ok_or_else\u0060, \u0060fork\u0060 and \u0060sdk/node-ts/native/sandbox_handle.rs:281\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ed8ce8844544b18a43d9e7df86d48ebf61af97b69ced95be5cd28ecebe22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/create_ops.rs:489-495 | crates/filesystem/lib/backends/dualfs/lookup.rs:652-659 | crates/filesystem/lib/backends/dualfs/lookup.rs:759-765 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:489\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. 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":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f7258a0e36eec2bd2cf6482f37f81b0446d9b5b0fc1b58708d6ac6f1c2838c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/filesystem/lib/backends/dualfs/file_ops.rs:89-96 | crates/filesystem/lib/backends/dualfs/lookup.rs:104-112 | crates/filesystem/lib/backends/dualfs/metadata.rs:146-153 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/metadata.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs:89\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":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31baa495ebfdd84f45e0232f68754f2599214b2f81d69dfab45a9a6c2555c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/runtime/lib/client/ipc.rs:112-119 | crates/runtime/lib/client/ipc.rs:493-500 | crates/runtime/lib/client/ipc.rs:672-679 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6226b91589a2908836d4933f8f8a4bd3fb7b1f5498e1e0e52e9f6855f0d1f242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sdk/go/native/src/lib.rs:2748-2755 | sdk/node-ts/native/sandbox_handle.rs:489-496 | sdk/ruby/ext/microsandbox/src/lib.rs:698-705 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/native/src/lib.rs:2748\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"69676baf9a5af6d1d5ea17fd841273ce2b67e55457a9f5f6cc438b17d661a060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sdk/go/native/src/lib.rs:7614-7621 | sdk/go/native/src/lib.rs:7641-7648 | sdk/go/native/src/lib.rs:7676-7683 \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 \u0060sdk/go/native/src/lib.rs:7614\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7614}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadafb84bc726e5e141268916cd33777e9d9a41235f47c5004662141f19258f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sdk/python/src/helpers.rs:2219-2226 | sdk/python/src/helpers.rs:2256-2263 | sdk/python/src/helpers.rs:2279-2286 \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 \u0060sdk/python/src/helpers.rs:2219\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ead05a82394fc86bd935b6c1eadb0e95a06bc30f4837f937992e6219f9a9b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/downgrade.rs:526-533 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:568-575 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:632-639 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ad1998ed8e73f586ee1e94f827bfd351c2dad545fa75a922bc245924c462e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/commands/run.rs:132-139 | crates/cli/lib/commands/run.rs:239-246 \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 \u0060crates/cli/lib/commands/run.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/run.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfb50a97a3af80a5cf7e606db45908b068b1bbab2922b141da4e59fae63c7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/commands/ssh.rs:383-390 | sdk/rust/lib/sandbox/ssh.rs:2789-2796 \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":"crates/cli/lib/commands/ssh.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3095014cfa586b267b7368de6b251001431b52be345245a57d17bb0132cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/db/lib/private_storage/storage.rs:168-175 | crates/runtime/lib/checkpoint/layout.rs:550-557 \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":"crates/db/lib/private_storage/storage.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9e0a7126282a3d6f07c4a8a07b409e72bc052d34edc8ebe5aa6f0607ccf667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/create_ops.rs:43-50 | crates/filesystem/lib/backends/dualfs/create_ops.rs:173-180 \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 \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:43\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":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b97252bb9bf2b63560b614a1ee7a875fb0a532e95c22dd825f9e893fcfe4866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/xattr_ops.rs:64-71 | crates/filesystem/lib/backends/dualfs/xattr_ops.rs:102-109 \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 \u0060crates/filesystem/lib/backends/dualfs/xattr_ops.rs:64\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":"crates/filesystem/lib/backends/dualfs/xattr_ops.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ca05341f8e7594e5a44e0613f0eb195cd6c546b4924a91cdd032fe2bf1b935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/filesystem/lib/backends/memfs/dir_ops.rs:130-137 | crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs:166-173 \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 \u0060crates/filesystem/lib/backends/memfs/dir_ops.rs:130\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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b521aa8cd85b604626b9a27109e3cc0e9a30fc945c00b913fc23d2d85d9db71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:661-668 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:826-833 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:661\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d308751a88325716032273f9fe09ea58ec059de03522bd953386aa125ec354b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/archive/docker.rs:772-780 | crates/image/lib/archive/docker.rs:1092-1099 \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 \u0060crates/image/lib/archive/docker.rs:772\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7fda82c4a18f60bdfb47da2a192a2c9beb1fe47e94d2f4c737c72f49dadc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/archive/docker.rs:1232-1240 | crates/image/lib/archive/docker.rs:1262-1269 \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 \u0060crates/image/lib/archive/docker.rs:1232\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"346468784df8e7346c90b7e9d959cbc9660ec396825adeea0d8bf1a91f674bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/archive/docker.rs:1809-1816 | crates/image/lib/archive/docker.rs:1832-1839 \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 \u0060crates/image/lib/archive/docker.rs:1809\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd601c592b86792b9bcc47fdf7dfcf1e139ffabf84910c1cfba94f586dfcb2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/checkpoint/compact.rs:138-145 | crates/image/lib/checkpoint/compact.rs:194-201 \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 \u0060crates/image/lib/checkpoint/compact.rs:138\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":"crates/image/lib/checkpoint/compact.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"636b54251219b0dfc33feba4867e4f174dda927df6423bc6f15db2f836947118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/checkpoint/compact.rs:147-154 | crates/image/lib/checkpoint/compact.rs:203-210 \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 \u0060crates/image/lib/checkpoint/compact.rs:147\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":"crates/image/lib/checkpoint/compact.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2417b5a4710db1fdfe6ce300146737a2152b5b9098bcef29b8301dc1ba040ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/checkpoint/qcow.rs:230-237 | crates/image/lib/checkpoint/store.rs:180-187 \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 \u0060crates/image/lib/checkpoint/qcow.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/qcow.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e390a229f0ace7aa65217849ab94dc5e00301291be0359a233ecb67e31da5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/erofs/reader.rs:430-437 | crates/image/lib/erofs/reader.rs:469-476 \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":"crates/image/lib/erofs/reader.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e459486601136e24e12405422f580e8c90e9cfabfa76f3b00065817619fc10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/ext4/formatter.rs:1540-1547 | crates/image/lib/ext4/formatter.rs:1563-1570 \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 \u0060crates/image/lib/ext4/formatter.rs:1540\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060\u0026FileData\u0060 in one and \u0060\u0026[u8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a266b26da2791f847e3471c0cf6eda1c1c129976d0541ab720d12ef0c15ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/tar/ingest.rs:430-437 | crates/image/lib/tar/ingest.rs:443-452 \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 \u0060crates/image/lib/tar/ingest.rs:443\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":"crates/image/lib/tar/ingest.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0ac857ecd094d84c4a2383a9db3db9d5704e389aaa785767285ec63057ccb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/network/lib/engine/icmp/relay.rs:505-515 | crates/network/lib/engine/icmp/relay.rs:567-574 \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 \u0060crates/network/lib/engine/icmp/relay.rs:505\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c162d372a7ea58397dba66d1328b240de028e8b6180e9fc35a718ca5ed0d144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/lib/checkpoint/coordinator.rs:571-578 | crates/runtime/lib/checkpoint/coordinator.rs:936-943 \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 \u0060crates/runtime/lib/checkpoint/coordinator.rs:571\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4852c8448f32197e87ddaa544e4a0c06010147d8a578e48d168c218a706fde23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/lib/client/compat/v0_5_9/launch.rs:325-332 | crates/runtime/lib/client/compat/v0_5_9/launch.rs:341-348 \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 \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:325\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a1557431442dedd67ed4a4c4dc49a5e5e285ef36ec776a6bf9b6a40249d0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:307-314 | crates/runtime/lib/runner/writeback/admission.rs:196-203 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/runner/cpu/allocation.rs:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6615fb6e93a6e2e59a0bb9294333ca160116be569f3935fa3d568e6177a6ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2622-2629 | crates/runtime/lib/runner/vm.rs:2673-2680 \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 \u0060crates/runtime/lib/runner/vm.rs:2622\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6958572875f28649f9ac8ed89509860b6586a0833fed55605f2016d48fb8324a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/utils/lib/copy.rs:274-281 | crates/utils/lib/extent.rs:201-207 \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 \u0060crates/utils/lib/copy.rs:274\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":"crates/utils/lib/copy.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"deda39c0132735749bae4a896725964d3f9ef19a9c9a0f1a4ad5d221c8e7523e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): sdk/go/native/src/lib.rs:1656-1663 | sdk/node-ts/native/network_builder.rs:397-403 \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 \u0060sdk/go/native/src/lib.rs:1656\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. 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":"sdk/go/native/src/lib.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fdafbf051f360edcdfdf14937d43e2f3dfba8253db2ed10939074bacf7f30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/native/src/lib.rs:3649-3656 | sdk/go/native/src/lib.rs:3720-3727 \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 \u0060sdk/go/native/src/lib.rs:3649\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"becb24abf715a0fac1eeb05b24a778e60d15564a7df8307d1b2abd284500830e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/native/src/lib.rs:6791-6798 | sdk/go/native/src/lib.rs:6812-6819 \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 \u0060sdk/go/native/src/lib.rs:6791\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6791}}}],"partialFingerprints":{"codehealthFindingId/v1":"932383f63e2492548ef5be0df3e2a2fe11a5bc2007dd37f7e5cca87e5dd3f1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/native/src/lib.rs:7004-7011 | sdk/go/native/src/lib.rs:7032-7039 \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 \u0060sdk/go/native/src/lib.rs:7004\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, \u0060sdk/go/native/src/lib.rs:7031\u0060 calls \u0060from\u0060, \u0060cstr\u0060 and \u0060sdk/go/native/src/lib.rs:7003\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7004}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ec3c2bf22b7e5d7472dd3069f93a252b5ebed9a97fa93fdf44f30e06f4b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/native/src/lib.rs:7420-7427 | sdk/go/native/src/lib.rs:7452-7459 \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 \u0060sdk/go/native/src/lib.rs:7420\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e7338de37aaf958ed838046768603c69159878952256b13f9a33a75f01523d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/node-ts/native/fs.rs:225-233 | sdk/node-ts/native/volume.rs:305-313 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/fs.rs\u0060 and \u0060sdk/node-ts/native/volume.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/node-ts/native/fs.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a4d15c9dde13caad4e04ec1705892c6857746309b3bc482b7428857a3bc4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/backend/cloud/sandbox.rs:186-193 | sdk/rust/lib/backend/cloud/sandbox.rs:202-209 \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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf2f55c8d716c6357f1597cbaa11fbf7faeb869b7c69b483d55f02eeb3c1ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): sdk/rust/lib/backend/local/mod.rs:683-690 | sdk/rust/lib/backend/local/snapshot/deletion.rs:89-95 \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 \u0060sdk/rust/lib/backend/local/mod.rs:683\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca60799fde7f1279577ddc5998189a2e144478587022798f6229c14e31ac964e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/migration.rs:313-320 | sdk/rust/lib/backend/local/snapshot/migration.rs:377-384 \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":"sdk/rust/lib/backend/local/snapshot/migration.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2930b1424884c3a4a999b0d8b9dbbef596d2ba0a7c8470fffa6840f2e2dbb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/runtime/spawn.rs:1577-1585 | sdk/rust/lib/runtime/spawn.rs:1914-1922 \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 \u0060sdk/rust/lib/runtime/spawn.rs:1577\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88370102b626f5363d1e7b296e3e4175a1e9e66337608a4bc8ae68d060aed76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/filesystem/lib/backends/dualfs/create_ops.rs:58-65 | crates/filesystem/lib/backends/dualfs/create_ops.rs:188-194 | crates/filesystem/lib/backends/dualfs/file_ops.rs:60-67 | crates/filesystem/lib/backends/dualfs/lookup.rs:76-83 | crates/filesystem/lib/backends/dualfs/metadata.rs:117-124 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/lookup.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/dualfs/create_ops.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/create_ops.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad3ba0ae8ec0f0bfcabf5d256b1a46adfb70c4c23d8e6a250228b1870e67072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/agentd/lib/agent.rs:4087-4093 | sdk/rust/lib/sandbox/mod.rs:1651-1657 | sdk/rust/lib/sandbox/ssh.rs:3215-3221 \u2014 before extracting anything, compare \u0060sdk/rust/lib/sandbox/mod.rs\u0060 and \u0060sdk/rust/lib/sandbox/ssh.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fd\u0060 to \u0060i32\u0060 in one and \u0060std::os::fd::RawFd\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/agent.rs"},"region":{"startLine":4087}}}],"partialFingerprints":{"codehealthFindingId/v1":"215b90ac5a33d0da1c3822d96779c6b736dc86ca7623ce15b980c7355658655d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): sdk/go/native/src/lib.rs:6295-6301 | sdk/go/native/src/lib.rs:6338-6344 | sdk/go/native/src/lib.rs:6395-6401 \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 \u0060sdk/go/native/src/lib.rs:6295\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6295}}}],"partialFingerprints":{"codehealthFindingId/v1":"51373466a909d6d51e3f510e2b740e83da962d43ac152f0f5ba624b83ad6d7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/agentd/lib/session.rs:1712-1718 | crates/agentd/lib/session.rs:1750-1756 \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":"crates/agentd/lib/session.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be4f9a891af589adf8a1337e621f87f6e306a47db3ffe246f9ff0f23b99ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/common.rs:2074-2080 | crates/cli/lib/commands/common.rs:2099-2105 \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 \u0060crates/cli/lib/commands/common.rs:2074\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc73235cc34d365b475b92115403a8ee7b9d96644875ab3a419f639c12c8e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/exec.rs:352-358 | crates/cli/lib/commands/jobs.rs:182-188 \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 \u0060crates/cli/lib/commands/exec.rs:352\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":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"720365d8a3db4e332fb7e1d3087864515617d0fd364bed89600180cb1acfcdd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/image.rs:436-442 | crates/cli/lib/commands/volume.rs:156-162 \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 \u0060crates/cli/lib/commands/image.rs:436\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fa38038fbc8c031b77e5baba06091cb8cf8dc6043da029755ab4c11732eef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/start.rs:37-43 | crates/cli/lib/commands/stop.rs:46-52 \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 \u0060crates/cli/lib/commands/start.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060StartArgs\u0060 in one and \u0060StopArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/start.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"515820a308c57e69c841e1d7f0c7f54588282cdb1c26885005b92de0f05b4365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/sandbox_config.rs:1592-1598 | sdk/rust/lib/sandbox/builder.rs:2343-2349 \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 \u0060crates/cli/lib/sandbox_config.rs:1592\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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1b1ef14ac05ed203a9f61cd26f8f7da4717df293a3e380b68932bb814b34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/image/lib/cache/store.rs:436-442 | crates/image/lib/flat.rs:43-49 \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":"crates/image/lib/cache/store.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f1cc326c9cba2af2bdec1e1314bab61e0e5cf0a4febf97ef308d4e443d0e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/network/lib/engine/secrets/handler.rs:1457-1463 | crates/network/lib/engine/secrets/handler.rs:3154-3160 \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 \u0060crates/network/lib/engine/secrets/handler.rs:1457\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efd13cef5b96f1bf7ef47b68873ddb48cb816209f1764c8fe63f9522ede41d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/network/lib/engine/secrets/handler.rs:2790-2796 | crates/network/lib/engine/secrets/handler.rs:2808-2814 \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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"536b53bdc8db59af15868582b3ad0de527936f214ef7c54adc9251cabd0b9599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/network/lib/engine/tls/proxy.rs:305-311 | crates/network/lib/engine/tls/proxy.rs:502-512 \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 \u0060crates/network/lib/engine/tls/proxy.rs:305\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":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f67f271a5878e935fe43cc1a4e5b781df81cb035bd88c667ec281d8a5f9c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/network/lib/engine/udp/relay.rs:865-871 | crates/network/lib/engine/udp/relay.rs:979-985 \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 \u0060crates/network/lib/engine/udp/relay.rs:865\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c40134864ce45ab956710c4a62b82457e7f089f7e9ef8fdebad4b86a870161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/network/lib/engine/udp/relay.rs:1431-1437 | crates/runtime/lib/client/memory_handoff.rs:77-83 \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 \u0060crates/network/lib/engine/udp/relay.rs:1431\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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69ef3253df1739e225bb1a11390c9b895e0b0171ba70a5c868d4bd883514b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/coordinator.rs:2484-2490 | crates/runtime/lib/checkpoint/coordinator.rs:2531-2537 \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 \u0060crates/runtime/lib/checkpoint/coordinator.rs:2484\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"725f5363642405226c68ba64d7993ff702b77d5fef04ac4db479dcb2247341c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:339-345 | crates/runtime/lib/checkpoint/owned_disk.rs:398-404 \u2014 before extracting anything, compare \u0060crates/runtime/lib/checkpoint/disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/owned_disk.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/checkpoint/disk.rs:339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/runtime/lib/checkpoint/disk.rs:348\u0060 calls \u0060is_none\u0060, \u0060first\u0060, \u0060clone\u0060 and \u0060crates/runtime/lib/checkpoint/owned_disk.rs:405\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f39a0faf3aaf456ceec8efbd3d1f50447d1b812df1b9e4fcf9914dcbd7fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:1368-1376 | crates/runtime/lib/checkpoint/owned_disk.rs:787-793 \u2014 before extracting anything, compare \u0060crates/runtime/lib/checkpoint/disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/owned_disk.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/checkpoint/disk.rs:1368\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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ba0b7048b725d75555500aba99e11c025117f69589bf6e1bf2f77070e47f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:1394-1400 | crates/runtime/lib/checkpoint/owned_disk.rs:829-835 \u2014 before extracting anything, compare \u0060crates/runtime/lib/checkpoint/disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/owned_disk.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e041557317cf23b1cb06b9186cc602ca21cc7b1370d1347eca184d98e11bab2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/runtime/lib/checkpoint/layout.rs:263-270 | crates/runtime/lib/checkpoint/layout.rs:287-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/layout.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aa2bab409e87486df6fcc3fadbabe316bfee2c0b06d19c178db73b0d8c3853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/migration/engine.rs:334-340 | crates/runtime/lib/checkpoint/migration/engine.rs:412-418 \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":"crates/runtime/lib/checkpoint/migration/engine.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe3053f4bf0a34de6590c3ff00c2dd05ac5ea92dd4e2f6ccdb8919c7349ac6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/runtime/lib/checkpoint/migration/source.rs:291-296 | crates/runtime/lib/checkpoint/migration/source.rs:499-505 \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 \u0060crates/runtime/lib/checkpoint/migration/source.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"253dc761d0a6233b9730699466e4885bdea419d5183bbb143b28b658528c58fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/migration/source.rs:1100-1106 | crates/runtime/lib/checkpoint/migration/source.rs:1221-1227 \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":"crates/runtime/lib/checkpoint/migration/source.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19a293a7368f8ea713e5ef8bf38b5c65f708f71c79a8dd8398e38f624483eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:191-197 | crates/runtime/lib/runner/writeback/admission.rs:128-134 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/runner/cpu/allocation.rs:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/lib/runner/writeback/admission.rs:125\u0060 calls \u0060sync_backing_files\u0060 and \u0060crates/runtime/lib/runner/cpu/allocation.rs:187\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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a030c409d530dc7a3a6be8e82cd30f601f948efefb8b1426a8375dba292ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:254-260 | crates/runtime/lib/runner/writeback/admission.rs:186-192 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/runner/cpu/allocation.rs:254\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96c1f18070dcd378bfe5648c586c64bc8a2858450954655406a5555fcb04ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/protocol-client/rust/lib/client.rs:69-75 | packages/protocol-client/rust/lib/client.rs:94-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/protocol-client/rust/lib/client.rs:69\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/rust/lib/client.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"118f0b44a48e2c0a99f3bcf5308b24a753b2eb99c82399255b97860e6305e419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/node-ts/native/snapshot.rs:358-364 | sdk/node-ts/native/snapshot.rs:374-380 \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 \u0060sdk/node-ts/native/snapshot.rs:358\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":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"32054d33181e958f32dd62d93c2fef6f7d2c85a51b8189cbf845ecf32b41c40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/python/src/helpers.rs:251-257 | sdk/python/src/helpers.rs:1602-1608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/helpers.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"09782fff66e514e0fe1d3368adeb9d5eb5978bd20e03a3fe1ba0ef35b7cc9707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/python/src/helpers.rs:1907-1913 | sdk/python/src/helpers.rs:1921-1927 \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":"sdk/python/src/helpers.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"d377e97d2e3b994648c51b8a5ffb131cba17109d6d0b3a26b18a6a9129d750ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/create.rs:348-354 | sdk/rust/lib/backend/local/snapshot/create.rs:691-696 \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 \u0060sdk/rust/lib/backend/local/snapshot/create.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16de6031446e613b335a603ff3aa6defb1bb3126dfbf3c95e38077b3f8f3959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/metadata.rs:84-90 | sdk/rust/lib/backend/local/snapshot/metadata.rs:192-198 \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 \u0060sdk/rust/lib/backend/local/snapshot/metadata.rs:84\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":"sdk/rust/lib/backend/local/snapshot/metadata.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fdcf33faf9043728ed2b516f283b6c75edf755dee920c3eac5fb7d80f21383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): sdk/python/src/sandbox.rs:604-609 | sdk/python/src/sandbox.rs:640-645 | sdk/python/src/sandbox.rs:798-803 | sdk/python/src/sandbox.rs:836-841 \u2014 all 4 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 \u0060sdk/python/src/sandbox.rs:604\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"356035c874bfff685d73a7da1fd684b931e8a56ab3b4950f650759eeca550f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/image/lib/erofs/fsmeta.rs:267-273 | crates/image/lib/erofs/fsmeta.rs:450-455 | crates/image/lib/erofs/writer.rs:676-682 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut FsmetaLayoutState\u0060 in one and \u0060\u0026mut LayoutState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/image/lib/erofs/writer.rs:689\u0060 calls \u0060RegularFile\u0060 and \u0060crates/image/lib/erofs/fsmeta.rs:277\u0060 does not \u2014 after which the two agree again for 3 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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bfbdd621dd567708ce95ee7c4c82f1c75e0479d3f140ebbf8b4b9afdf8e534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/network/lib/engine/udp/relay.rs:1431-1437 | crates/runtime/lib/client/memory_handoff.rs:77-83 | crates/runtime/lib/client/memory_handoff.rs:114-119 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/udp/relay.rs:1431\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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b583e28f4c897cffdc95823fffa87c960c4d33914a41eeb7a686c2cdf82dab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/runtime/lib/client/ipc.rs:770-775 | crates/runtime/lib/runner/heartbeat.rs:199-204 | sdk/rust/lib/image/cleanup_journal.rs:419-424 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"198cbaf4f5999f386122899e4048258f276112d4d62968fcd7bd035f89c304dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/memfs/dir_ops.rs:125-130 | crates/filesystem/lib/backends/memfs/dir_ops.rs:250-255 \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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"859163f1bc8e8a9f6461b728eb434445881f4c265ac38b8066a34d32cf22c91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:113-118 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:284-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baa2dab2a3106f2e993d3e3170c75dff460d39de208dbba4b6a9295fa72b863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:302-307 | crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs:329-334 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 44 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3704846eb34b47f23c560cc5e4d6f2d75bb45fbcccc77df8c8eb4ef395232a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/special.rs:37-42 | crates/filesystem/lib/backends/passthroughfs/unix/special.rs:206-211 \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":"crates/filesystem/lib/backends/passthroughfs/unix/special.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b7a7555c306510f2fb8688204a6cea6f45484db545d549c1417262050d3f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/image/lib/cache/store.rs:679-684 | crates/image/lib/cache/store.rs:753-760 \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 \u0060crates/image/lib/cache/store.rs:679\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":"crates/image/lib/cache/store.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7d63152156740ae1180b98ec6257b34c4974ca6e1167f3fed9582b9544361c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/image/lib/checkpoint/store.rs:497-502 | sdk/rust/lib/runtime/launch_contract.rs:601-606 \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 \u0060crates/image/lib/checkpoint/store.rs:497\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":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e0383ff309bdc484e6f4597ed5a4cb14163a9fff04de4dcc33e034c2359bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/network/lib/engine/icmp/relay.rs:187-192 | crates/network/lib/engine/icmp/relay.rs:268-273 \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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc6315bb0c27b8d4271370baec4172c62124aac11c4621acf38864ad36fedd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/lib/checkpoint/disk.rs:169-175 | crates/runtime/lib/checkpoint/disk.rs:960-965 \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 \u0060crates/runtime/lib/checkpoint/disk.rs:169\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. 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":"crates/runtime/lib/checkpoint/disk.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf773da157e8fcf10e943f583e0b2fdd9d28a5b36500aaf86f6e16f10529b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/lib/client/maintenance.rs:327-332 | crates/runtime/lib/client/maintenance.rs:803-808 \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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0b0d3c548f8f2097b4fa42d8585903e93e62d3cd62bccfb16835e5553ed14f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utils/lib/copy.rs:289-294 | crates/utils/lib/extent.rs:218-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/lib/copy.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca1a2357e03baffc6e5a4f707de192ab41bb3aadc2ef9fa9d5f49c0f7a09b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:6316-6321 | sdk/go/native/src/lib.rs:6416-6421 \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 \u0060sdk/go/native/src/lib.rs:6316\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6316}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba9c6c8312bbf3430765a08fd55c3630cc72607cbe7975a268bf2ff5d5d1826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:6931-6936 | sdk/go/native/src/lib.rs:6971-6976 \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 \u0060sdk/go/native/src/lib.rs:6931\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":6931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7215daed54dcd025cbf40167a5e7c8973ef68636af0564c063e7585df0ee7ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/fs.rs:207-212 | sdk/node-ts/native/volume.rs:287-292 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/fs.rs\u0060 and \u0060sdk/node-ts/native/volume.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/node-ts/native/fs.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fea46e39ad6db8a7f480daa4b01d5fc7fb08b21f1c6e0f4d29aff4c8e4a109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/network_builder.rs:56-61 | sdk/node-ts/native/sandbox_builder.rs:576-581 \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 \u0060sdk/node-ts/native/network_builder.rs:56\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e31ec7ad7da2aa2f01505dd40a4aa8d69d98c438429b088359fb3df8a14d758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/network_builder.rs:71-76 | sdk/node-ts/native/sandbox_builder.rs:591-596 \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 \u0060sdk/node-ts/native/network_builder.rs:71\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38aa5360b2e2b2ffb44056405ae84f56797aaeed9590a525b781eb8c50c6598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/network_builder.rs:85-90 | sdk/node-ts/native/sandbox_builder.rs:605-610 \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 \u0060sdk/node-ts/native/network_builder.rs:85\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"56514bbd777edcd1d9bd77f1dfb7a7af6ceb78a7a318ed0fa5a106b66df72d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/network_builder.rs:105-110 | sdk/node-ts/native/sandbox_builder.rs:625-630 \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 \u0060sdk/node-ts/native/network_builder.rs:105\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac14c2363c90ab73931b5d82a1eef83131c9988f1ca0e58c901554c2e05152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:1402-1411 | sdk/python/src/sandbox.rs:1745-1750 \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 \u0060sdk/node-ts/native/sandbox.rs:1402\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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d649552e22e9a2a7fcb2a77e1e0604916208911669f4c74ab9e4e03fc519189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/python/src/sandbox_handle.rs:483-488 | sdk/python/src/sandbox_handle.rs:513-518 \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 \u0060sdk/python/src/sandbox_handle.rs:483\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":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bc19f1e8f74e460f5c17945a218dc47702fbdc5bec4d0fe0a7a1f04af815ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/python/src/ssh.rs:283-288 | sdk/python/src/ssh.rs:420-425 \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 \u0060sdk/python/src/ssh.rs:283\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":"sdk/python/src/ssh.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d69198b9c579afbb5c8c214a36bfff51155ca8a16fa154287c789963942fe8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:2234-2239 | sdk/ruby/ext/microsandbox/src/lib.rs:2247-2252 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"731800c476388f6cd2ae19ac480dd543e1389961808b2ca5a41439f32ad44bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/deletion.rs:77-90 | sdk/rust/lib/image/cleanup_journal.rs:43-56 \u2014 before extracting anything, compare \u0060sdk/rust/lib/backend/local/snapshot/deletion.rs\u0060 and \u0060sdk/rust/lib/image/cleanup_journal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/backend/local/snapshot/deletion.rs:77\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":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb10e66b50eb0068fd90dd619df07ff841383a1bfc2f17dabedcf8fab53d185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 8): sdk/node-ts/native/network_builder.rs:67-71 | sdk/node-ts/native/network_builder.rs:101-105 | sdk/node-ts/native/restore_builder.rs:289-292 | sdk/node-ts/native/restore_builder.rs:301-305 | sdk/node-ts/native/restore_builder.rs:318-321 | sdk/node-ts/native/restore_builder.rs:335-339 | sdk/node-ts/native/sandbox_builder.rs:587-591 | sdk/node-ts/native/sandbox_builder.rs:621-625 \u2014 there are 8 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/node-ts/native/restore_builder.rs:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 before the matched lines, \u0060sdk/node-ts/native/restore_builder.rs:288\u0060 calls \u0060try_from\u0060, \u0060map_err\u0060, \u0060from_reason\u0060 and \u0060sdk/node-ts/native/network_builder.rs:67\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":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d2d9d6b45a3ad95a81ae7e6c51f0d581f86763bacd3e21feba46c003065b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/image/lib/erofs/fsmeta.rs:270-274 | crates/image/lib/erofs/fsmeta.rs:395-399 | crates/image/lib/erofs/fsmeta.rs:452-456 | crates/image/lib/erofs/writer.rs:679-684 \u2014 before extracting anything, compare \u0060crates/image/lib/erofs/fsmeta.rs\u0060 and \u0060crates/image/lib/erofs/writer.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 241 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut FsmetaLayoutState\u0060 in one and \u0060\u0026mut LayoutState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/image/lib/erofs/writer.rs:689\u0060 calls \u0060RegularFile\u0060 and \u0060crates/image/lib/erofs/fsmeta.rs:277\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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1480f5dffb9a2f3b95861e4320a5e4f4d46510ab264bdf7a6d650bb17f0e84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): sdk/go/native/src/lib.rs:5062-5067 | sdk/go/native/src/lib.rs:5085-5090 | sdk/go/native/src/lib.rs:5162-5166 | sdk/go/native/src/lib.rs:5182-5186 \u2014 all 4 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 \u0060sdk/go/native/src/lib.rs:5062\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6bb58b7817471d5b9ba84a0b6f2ffbde41d63e815a5743bc0e46aa23abb9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/image/lib/checkpoint/store.rs:495-499 | sdk/rust/lib/runtime/launch_contract.rs:599-603 | sdk/rust/lib/volume/fs_root.rs:414-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed63fcadbe1ffa4c7c13d1b908131b00b4e63d33b027bd3b2fef2fd54f3aa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs:78-83 | crates/migration/lib/m20260710_000001_migrate_root_disk.rs:145-150 | crates/migration/lib/m20260710_000001_migrate_root_disk.rs:184-188 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/migration/lib/m20260710_000001_migrate_root_disk.rs:151\u0060 calls \u0060and_then\u0060, \u0060as_object_mut\u0060 and \u0060crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs:84\u0060 does not \u2014 after which the two agree again for 3 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":"crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ac2528315b564f17ff9e3c2f5f2298d123c8126913969852ec0587c617fb7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sdk/python/src/sandbox.rs:680-685 | sdk/python/src/sandbox.rs:720-725 | sdk/python/src/sandbox.rs:760-765 \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 \u0060sdk/python/src/sandbox.rs:680\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"120f8a1c408472224e938943a739b17560947afae90beff8706d11a0b0f1fd17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): sdk/rust/lib/backend/local/mod.rs:682-688 | sdk/rust/lib/backend/local/snapshot/deletion.rs:88-93 | sdk/rust/lib/image/cleanup_journal.rs:54-59 \u2014 before extracting anything, compare \u0060sdk/rust/lib/backend/local/snapshot/deletion.rs\u0060 and \u0060sdk/rust/lib/image/cleanup_journal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/backend/local/mod.rs:682\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":"sdk/rust/lib/backend/local/mod.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"e132c13b4256e770646bb383debebeaf42aae5170917430b77761facdbedd6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:325-330 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:404-409 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:325\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs:324\u0060 calls \u0060store\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:403\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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a612550f97507308504ada584f91c02d579ee9a3d7354f0fcbe4bcf405f5ddbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:328-332 | crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:341-345 \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 \u0060crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs:328\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":"crates/filesystem/lib/backends/passthroughfs/unix/remove_ops.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7173e416f69d7953386051d5ac4d1d7bd46961598132b8affb7afb0d00e924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/image/lib/archive/docker.rs:1004-1008 | crates/image/lib/archive/docker.rs:1378-1382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/image/lib/archive/docker.rs:1009\u0060 calls \u0060with_capacity\u0060 and \u0060crates/image/lib/archive/docker.rs:1383\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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"16519bfe665b30511ac0beccf2101f2229e6b3a9deb0ebe7672d1acc780e6062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/metrics/lib/compatibility.rs:286-291 | crates/metrics/lib/registry.rs:1439-1443 \u2014 before extracting anything, compare \u0060crates/metrics/lib/compatibility.rs\u0060 and \u0060crates/metrics/lib/registry.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/metrics/lib/compatibility.rs:286\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060slot\u0060 to \u0060\u0026SlotV2\u0060 in one and \u0060\u0026Slot\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics/lib/compatibility.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da41111de8bf257173c6e37a15a000c0e6d7f7127662c4e55135ba7834f9a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/network/lib/engine/ports/publisher.rs:582-586 | crates/network/lib/engine/tcp/connection.rs:484-488 \u2014 before extracting anything, compare \u0060crates/network/lib/engine/ports/publisher.rs\u0060 and \u0060crates/network/lib/engine/tcp/connection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/ports/publisher.rs:582\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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"32be60547a09fa6fb2254748036fcee5bfee6a19c3666d9f81c641581ab21151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/network/lib/engine/udp/relay.rs:1185-1190 | crates/network/lib/engine/udp/relay.rs:1197-1202 \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 \u0060crates/network/lib/engine/udp/relay.rs:1185\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":"crates/network/lib/engine/udp/relay.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"066f6b3eaa33fddbf7c0bb1e276c1e0302133127afda024f9eaf29f32669281b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/client/maintenance.rs:828-832 | crates/runtime/lib/client/maintenance.rs:877-881 \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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f307a8b3145a1e89cf168cba6312f585ee8a42df6b10da1952bb967ef43638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:231-235 | crates/runtime/lib/runner/writeback/admission.rs:178-182 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c44b384b68f0d2af6088aafe28bf0984b36bf00d4faa9be35cd63f881146f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:464-468 | crates/runtime/lib/runner/writeback/admission.rs:744-748 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/runner/cpu/allocation.rs:464\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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b23fc994eb0e9b534cc2d57945d4401c70e95106ace5420725fe256ec4a78d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/go/native/src/lib.rs:2711-2717 | sdk/go/native/src/restore.rs:207-211 \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 \u0060sdk/go/native/src/lib.rs:2711\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb29d6e942aa403a46707557b7a4424d0d601bed97f59fc28b1b1395ace6a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/go/native/src/lib.rs:4831-4835 | sdk/go/native/src/lib.rs:5666-5670 \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 \u0060sdk/go/native/src/lib.rs:4831\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"49671a2623d3a623347c07e0bd92852717df4b76f34c0493bcaa2477dc3de3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:5669-5674 | sdk/go/native/src/lib.rs:5725-5730 \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 \u0060sdk/go/native/src/lib.rs:5669\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, \u0060sdk/go/native/src/lib.rs:5668\u0060 calls \u0060cstr\u0060 and \u0060sdk/go/native/src/lib.rs:5724\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efef9bc3f3a11284cb54baa32182ee8eb9c750f97b66544493e5f0dde703d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:5951-5956 | sdk/go/native/src/lib.rs:7307-7312 \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 \u0060sdk/go/native/src/lib.rs:5951\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5951}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fbf52da8474d3a0f3c13f87371c2afd096b577fad622a596459091e5b98586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/python/src/fs.rs:300-305 | sdk/python/src/fs.rs:323-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/fs.rs:300\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":"sdk/python/src/fs.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"855324881398c553a4cc09321f1fc97b35a31d215bab049f74afb89d2495ad76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/python/src/jobs.rs:270-274 | sdk/ruby/ext/microsandbox/src/jobs.rs:216-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/jobs.rs:270\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":"sdk/python/src/jobs.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e987e2cbd7afa60a989ece6b66a069bd779e6c7b30ac9d748aedd17addc84967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/python/src/volume.rs:180-186 | sdk/python/src/volume.rs:225-231 \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 \u0060sdk/python/src/volume.rs:180\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":"sdk/python/src/volume.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae409d4e75e471c658a4ea6d07901c7b58f96be474021ac2456d90d4ea4b21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:843-848 | sdk/ruby/ext/microsandbox/src/lib.rs:975-980 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d949c41ee0c84ac5b2c1e334bc782c969898431f166756a204f531153147acbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:2401-2406 | sdk/ruby/ext/microsandbox/src/lib.rs:2458-2463 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0c8def437a8416089f1eb59aaac3b4520d564b8c6709ed6bf76b330b0a597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/create.rs:1401-1405 | sdk/rust/lib/sandbox/modify/local.rs:813-817 \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 \u0060sdk/rust/lib/backend/local/snapshot/create.rs:1401\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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"320fbd2da81fe087db90c1da36a1d21c8221221b06d5c9ac0f1f367a6bd13e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/logs/mod.rs:302-306 | sdk/rust/lib/logs/mod.rs:330-334 \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":"sdk/rust/lib/logs/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0631e7fd1ed8515ffc99b7b55538dc95b3ff013627b8f5fe102d955337208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/commands/copy.rs:760-767 | sdk/rust/lib/volume/fs.rs:739-746 \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":"crates/cli/lib/commands/copy.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cc562653ebec94b46b0f0bdbcb13518a3f90a8bb0e479cc4f4d29dc12b4833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/lib/commands/copy/host.rs:226-236 | crates/cli/lib/commands/copy/host_windows.rs:170-180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/copy/host.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c5b703ffab879af32a4b4a7054065afc311d7d61d2ea2d86cbe84323808f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/image.rs:880-886 | crates/cli/lib/commands/snapshot.rs:712-718 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/image.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc47019f6c469cabc5ac9f1a3ab1a5ab5a9f108d9957bd1807a95b45864acdf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/cli/lib/commands/inspect.rs:452-458 | crates/cli/lib/commands/ps.rs:205-211 | sdk/rust/lib/sandbox/modify/local.rs:2118-2124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/inspect.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a5e53f164383c14e243f2883877da65301f3ba882445b3052b4a274e5d67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/lib/commands/self_cmd.rs:3025-3030 | sdk/rust/lib/backend/local/snapshot/downgrade.rs:1571-1576 \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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c37b4cb2d38f6c926b8892442d75934d86ea9dde8b55adca37599184a07a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/cli/lib/commands/ssh.rs:321-327 | crates/cli/lib/commands/ssh.rs:332-338 | sdk/rust/lib/sandbox/ssh.rs:3159-3165 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/lib/commands/ssh.rs:321\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060builder\u0060 to \u0060SshClientOptionsBuilder\u0060 in one and \u0060SshServerOptionsBuilder\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/ssh.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e0e1723be5ae5cc9f0ee65dcdc4a55220d7809d06a9760dfbb24becfc812f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/commands/ssh.rs:392-399 | sdk/rust/lib/sandbox/ssh.rs:2798-2805 \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":"crates/cli/lib/commands/ssh.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff711845ec72ae8104c8806ea8d25e85b5755902aa019ecf23dfd2c3d6e2bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/filesystem/lib/backends/dualfs/file_ops.rs:578-586 | crates/filesystem/lib/backends/dualfs/special.rs:351-359 \u2014 before extracting anything, compare \u0060crates/filesystem/lib/backends/dualfs/file_ops.rs\u0060 and \u0060crates/filesystem/lib/backends/dualfs/special.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/dualfs/file_ops.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5a184fe5d4205b995a6e3a36b2183b617c85f57df57a973e836655b354b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/filesystem/lib/backends/passthroughfs/owned.rs:706-711 | crates/runtime/lib/checkpoint/migration/engine.rs:1118-1123 | crates/runtime/lib/checkpoint/migration/source.rs:983-988 | sdk/rust/lib/backend/local/snapshot/archive.rs:3132-3137 | sdk/rust/lib/sandbox/storage_preview_lower.rs:147-151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd8feacc2951c5d1fbea9562d0059f4ae69792029a227047a01523363b300f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/filesystem/lib/backends/passthroughfs/owned.rs:743-749 | crates/runtime/lib/checkpoint/disk.rs:1402-1408 | sdk/rust/lib/backend/local/snapshot/deletion.rs:275-281 | sdk/rust/lib/image/cleanup_journal.rs:454-460 \u2014 before extracting anything, compare \u0060sdk/rust/lib/backend/local/snapshot/deletion.rs\u0060 and \u0060sdk/rust/lib/image/cleanup_journal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/owned.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e0c269990742f61a04ea59e1aafbdb8f6fd28b19f3b3c1ede649c12c4999eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/image/lib/archive/docker.rs:1914-1918 | crates/image/lib/registry/client.rs:1899-1903 \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":"crates/image/lib/archive/docker.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c165db3b8b258309e15aa89d69c5f39fc03bef2f63fc0890a96451397a8a98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/image/lib/checkpoint/admitted_disk.rs:125-132 | crates/runtime/lib/checkpoint/additional_disk.rs:320-327 | crates/runtime/lib/checkpoint/local_disk.rs:140-147 \u2014 before extracting anything, compare \u0060crates/image/lib/checkpoint/admitted_disk.rs\u0060 and \u0060crates/runtime/lib/checkpoint/additional_disk.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/admitted_disk.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"af74b7beb35da51cd5ccd91701b9d48b0b5a9ade65c5a9c3919a7ed39f13ea5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/image/lib/checkpoint/qcow.rs:258-264 | crates/runtime/lib/checkpoint/coordinator.rs:2564-2570 \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":"crates/image/lib/checkpoint/qcow.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d791b26da77fe46183569717262c95af3008bc953484c34ce981abf8247621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/image/lib/checkpoint/store.rs:736-742 | sdk/rust/lib/backend/local/snapshot/verify.rs:515-521 \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":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcc65a15b81dd290480cc2af7199c1c574e57deeb69767a70a438457cd3baeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/image/lib/ext4/layout.rs:243-247 | crates/image/lib/ext4/resizer.rs:1296-1300 \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 \u0060crates/image/lib/ext4/layout.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/ext4/layout.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3503ec399172e7116d47d3bdaf8f6e6d2d9eee3be5cfb61588c841d9d0e1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/checkpoint/additional_disk.rs:334-340 | sdk/rust/lib/backend/local/snapshot/archive/owned.rs:119-125 \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":"crates/runtime/lib/checkpoint/additional_disk.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cd5dc8eaf82475a83185c17a31ca2d1b1cb135c5d55fa67af35aac5a3c77a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/runtime/lib/client/maintenance.rs:895-909 | sdk/rust/lib/backend/local/sandbox/mod.rs:987-1001 \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 \u0060crates/runtime/lib/client/maintenance.rs:895\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":"crates/runtime/lib/client/maintenance.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e438b16ba782c96e93526b01a207db656ad42a0d349c584438fd12e1575c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:483-491 | crates/runtime/lib/runner/writeback/admission.rs:763-771 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5ed6706ea56a76707a1946396dd495cdca80823720e0fbddb74f80dcecc326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:493-497 | crates/runtime/lib/runner/writeback/admission.rs:773-777 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2d98d6fe0eaccc82fb348ac88c920bb119358a03da45fdaa8a72298380471a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/lib/runner/cpu/mod.rs:129-134 | crates/runtime/lib/runner/writeback/admission.rs:107-112 \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":"crates/runtime/lib/runner/cpu/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75eed0b51c9ade0e26b430ec3749d40802196976371c797dfae77b416b681ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:263-269 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:402-408 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8190cc1deca992853cb29230e62513b26c3ed8f6a13850f3cbde8f066fe104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:272-277 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:411-416 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0d3bb81294fb52a902f0d1008ab53a99cf4043e8fc2b64281c6cc6335bf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:377-383 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:489-495 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adb5b0734244106ba88227923e02391a06d0e6a940d2530c5b01eac81af1431"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:407-411 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:519-523 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1045ee1a9a8224003d32aeb47f4a4c332e3ce5a7000eb96e1cf13d2dd432cfbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/native/src/lib.rs:4072-4079 | sdk/ruby/ext/microsandbox/src/lib.rs:2573-2580 \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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1931d03da529e924c2bd12050604dca36c28e99718885d387270d6fb16949002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sdk/go/native/src/lib.rs:7850-7857 | sdk/node-ts/native/fs.rs:240-247 | sdk/ruby/ext/microsandbox/src/lib.rs:2630-2637 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060kind\u0060 to \u0060FsEntryKind\u0060 in one and \u0060\u0026FsEntryKind\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/native/src/lib.rs"},"region":{"startLine":7850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb33c90efecba084ab6c0d7b33d25b22006ff443fa4de800613d5e2df31ab890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:60-65 | sdk/node-ts/native/exec_options_builder.rs:91-96 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131f7cada303032ebc2710b4a7d51d9362894d1e3ba65157bbbd9403a8038e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:68-73 | sdk/node-ts/native/exec_options_builder.rs:100-105 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"428fb545fe0832fd2c4303a3ddb0df66208f0f7dbbf767a6f0027f1362a2f806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:76-81 | sdk/node-ts/native/exec_options_builder.rs:109-114 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"00752afa227b9c518c795483841490d733bc2eb552406affd13afea86eab6828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:84-89 | sdk/node-ts/native/exec_options_builder.rs:118-123 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc75a206d090059045d7cb3778304ccff3b58691b3c17c363835439b4b6da082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:92-97 | sdk/node-ts/native/exec_options_builder.rs:127-132 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1184684a5632f57151e0f93b43cc193d3baab7f2b4338896aa409ab988c424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/node-ts/native/attach_options_builder.rs:100-107 | sdk/node-ts/native/exec_options_builder.rs:136-143 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/attach_options_builder.rs\u0060 and \u0060sdk/node-ts/native/exec_options_builder.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/attach_options_builder.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce107847925cd3f518ce294ab5b84d52594997cb09194c00339cd8e7705fc00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/node-ts/native/fs.rs:193-199 | sdk/node-ts/native/volume.rs:328-334 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/fs.rs\u0060 and \u0060sdk/node-ts/native/volume.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/fs.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bfb9ce2bbb1a94233d5564d87436588606fc1dea967b0be917ed660151e0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/node-ts/native/fs.rs:249-257 | sdk/node-ts/native/volume.rs:369-377 \u2014 before extracting anything, compare \u0060sdk/node-ts/native/fs.rs\u0060 and \u0060sdk/node-ts/native/volume.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/fs.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ceb13429f83d2d58d630b186220734ee0201887702a3200ef5d57cad2f69fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/image_builder.rs:103-107 | sdk/node-ts/native/mount_builder.rs:218-222 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/image_builder.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae22c15fe17efd7f75cb1dd2f070928157f2bece493944f0970a3a6aeb25156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/image_builder.rs:113-117 | sdk/node-ts/native/mount_builder.rs:92-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/image_builder.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fce5388e7a38790d52916de3d4cb9a07854fa49512eca08b8e8ba50d768a1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/node-ts/native/mount_builder.rs:285-291 | sdk/node-ts/native/root_disk_builder.rs:48-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90ae9e59489d9d2d420d15e6cef6e9ac4243c63dec3439387868cf27501d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:1160-1164 | sdk/python/src/logs.rs:246-250 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"92640afc3a7ff156d5bc3d102a67fe78dc32b0d3adc413cfd861dc46c50e3d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): sdk/node-ts/native/snapshot.rs:424-430 | sdk/node-ts/native/volume.rs:155-161 | sdk/python/src/snapshot.rs:492-498 | sdk/python/src/volume.rs:386-392 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff68a00b74e5b0478fbd7e31a82b8ba5b56e233d6d57bb104cfb1816f91d564e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): sdk/python/src/fs.rs:310-314 | sdk/python/src/sandbox.rs:1526-1530 | sdk/python/src/sandbox.rs:2474-2478 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/fs.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4da80bc4eaea6dea49d4c43d61fae551e360be93a82436229277899c6e590d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/python/src/sandbox.rs:1223-1233 | sdk/python/src/sandbox_handle.rs:440-450 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1223\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37f99382d3e59a555d87ada085e8769fed1586fe0778ccf1548e17269ed48a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/python/src/sandbox.rs:1244-1254 | sdk/python/src/sandbox_handle.rs:461-471 \u2014 before extracting anything, compare \u0060sdk/python/src/sandbox.rs\u0060 and \u0060sdk/python/src/sandbox_handle.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/python/src/sandbox.rs:1244\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e762a7f654e794fd9d6a6323c87c50d309319837d6fd5eee729461db15f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): sdk/python/src/sandbox_handle.rs:128-134 | sdk/python/src/snapshot.rs:55-61 | sdk/python/src/snapshot.rs:701-707 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/sandbox_handle.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab81e9fb4d98cb31b222ca5ff221c521647844bf3d0fc41e3bfa07c3d98cadd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:2554-2564 | sdk/rust/lib/sandbox/modify/local.rs:2106-2116 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f81ca9ef485bab45e30514ae1ff9d6b22940bd78e6d6d81ad878bd0a3a540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/deletion.rs:241-245 | sdk/rust/lib/image/cleanup_journal.rs:382-386 \u2014 before extracting anything, compare \u0060sdk/rust/lib/backend/local/snapshot/deletion.rs\u0060 and \u0060sdk/rust/lib/image/cleanup_journal.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e5352c17512d537d0ae987795888d765f21ca06499bda8d5788f4425617edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/sandbox/fs.rs:686-692 | sdk/rust/lib/volume/fs.rs:289-295 \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":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e4971c3d50bedf7bdf93a4312878f56a3a10dd014ab04c3f03978b823de31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/migration/lib/m20260305_000004_create_sandbox_images_table.rs:103-108 | crates/migration/lib/m20260531_000001_create_sandbox_labels.rs:83-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/migration/lib/m20260305_000004_create_sandbox_images_table.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd75e5c2e7797400789da2320994b96860a75a4cbf92540007b63a7106a46fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/node-ts/native/network_builder.rs:242-247 | sdk/node-ts/native/secret_builder.rs:172-177 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/network_builder.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9deba3925935a375d695f65417e992f09f76529a58ed25f282f42fe6de60ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): sdk/node-ts/native/registry_builder.rs:74-79 | sdk/node-ts/native/snapshot_builder.rs:116-121 | sdk/node-ts/native/snapshot_builder.rs:125-130 | sdk/node-ts/native/snapshot_builder.rs:134-139 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/registry_builder.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b21b17a1ab32bdaebe77198359de353a09846306e4d1e6a5726dfb7f5568cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): sdk/node-ts/native/restore_builder.rs:51-55 | sdk/node-ts/native/restore_builder.rs:185-189 | sdk/node-ts/native/restore_builder.rs:256-260 | sdk/node-ts/native/snapshot_copy_builder.rs:35-39 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c2e0686555c2c8bc68461e5347f27e0acda8d29187c7521bf1d8582799a025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/setup.rs:25-30 | sdk/python/src/setup.rs:11-15 \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":"sdk/node-ts/native/setup.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"674a1e235a8eb778fe674e6d3ef9a4c8e6be011ea299e29ae48c7ffbc8ebfbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): sdk/node-ts/native/snapshot.rs:253-258 | sdk/node-ts/native/snapshot.rs:634-639 | sdk/python/src/snapshot.rs:358-363 | sdk/python/src/snapshot.rs:809-814 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/snapshot.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a597828dc716e0f13ca9a7c32979348f7daddbbd65dab08b7db5393510765012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/python/src/error.rs:156-161 | sdk/ruby/ext/microsandbox/src/lib.rs:397-402 \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":"sdk/python/src/error.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bae4d52fc05a03b6ff449ddd606ce42201cfe8af299935d99b21ebd54cae6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/python/src/exec.rs:170-176 | sdk/python/src/snapshot.rs:838-844 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/python/src/exec.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cb0038b0d6d7792260422aa7285243b98dc5a41b65e37ccddac4e848708bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): sdk/rust/lib/sandbox/handle.rs:218-223 | sdk/rust/lib/sandbox/handle.rs:226-231 | sdk/rust/lib/volume/mod.rs:348-353 | sdk/rust/lib/volume/mod.rs:356-361 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d57de5a5710c3310b393ddd797de6a4208fe7a743b48733c286a64e3188591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sdk/rust/lib/sandbox/handle.rs:251-256 | sdk/rust/lib/sandbox/handle.rs:376-381 | sdk/rust/lib/volume/mod.rs:408-415 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"115482a8062b570b66b44610aeaace61a72a907e99c3533bdb66e14dc4c55b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/rust/lib/sandbox/handle.rs:270-275 | sdk/rust/lib/volume/mod.rs:444-449 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa51b6973503b96a17d38c2a1434457dee0cc796f144f5ead782265ec1a12b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/sandbox/patch.rs:321-328 | sdk/rust/lib/volume/fs_root.rs:285-292 \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":"sdk/rust/lib/sandbox/patch.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1fdad82cf05c7955fb92dc917c77592934b6753efc772d6cbc8ea8aea65e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/agentd/lib/agent.rs:1623-1636 | crates/runtime/lib/runner/relay.rs:3529-3542 \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 \u0060crates/agentd/lib/agent.rs:1623\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54c1d8ec88889d6e971d4be0171efe9d29aeed5d6ee8cd12778fc39edf41d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/runtime/lib/runner/cpu/mod.rs:166-178 | crates/runtime/lib/runner/cpu/mod.rs:182-194 \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 \u0060crates/runtime/lib/runner/cpu/mod.rs:166\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":"crates/runtime/lib/runner/cpu/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3f0507942651ecb87d00c02c3e8038a38d8ccb3c5ea446d5da391fd777808c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/lib/machine_cmd.rs:246-258 | crates/cli/lib/machine_cmd.rs:299-311 \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 \u0060crates/cli/lib/machine_cmd.rs:246\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80f18bd50035b65e5b3ceb9c1d6c471f9dc4871f2d55ee3cbfbe5a4b78f07af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:433-444 | crates/runtime/lib/runner/writeback/admission.rs:705-717 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/lib/runner/cpu/allocation.rs:433\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4721b84a5e0443eb5eb4e8d87f0b46d34e9881bbdb3babcfecddee7a5dcbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/lib/commands/list.rs:63-75 | crates/cli/lib/commands/volume.rs:161-173 \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 \u0060crates/cli/lib/commands/list.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060ListArgs\u0060 in one and \u0060VolumeListArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/list.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa5ab78b3f9c20d6e5c3b7ec8d2e5d789ee5b398cc16d9347be16b0f0465a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/runtime/lib/runner/control/executor.rs:411-423 | crates/runtime/lib/runner/control/executor.rs:550-562 \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 \u0060crates/runtime/lib/runner/control/executor.rs:411\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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43afe7b99d5ce93ed5754228ac2d99750f1e81cac26cb32e70e6b0417aad261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/network/lib/engine/icmp/relay.rs:522-534 | crates/network/lib/engine/icmp/relay.rs:580-592 \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 \u0060crates/network/lib/engine/icmp/relay.rs:522\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cab8ba8378964d07b68c88184c3a449d8dd2e12a44142eb8cf3f60c6bb1d555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/network/lib/engine/dns/client.rs:61-72 | crates/network/lib/engine/dns/client.rs:101-109 \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 \u0060crates/network/lib/engine/dns/client.rs:61\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":"crates/network/lib/engine/dns/client.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad90738c5fcf544cf7f482a7eca36124cf054e4f7f8bfd6190d97b0d6c465060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/rust/lib/backend/cloud/volume.rs:406-417 | sdk/rust/lib/backend/cloud/volume.rs:427-438 \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 \u0060sdk/rust/lib/backend/cloud/volume.rs:406\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":"sdk/rust/lib/backend/cloud/volume.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b67294c0fb4cce2e2f11922f9b4bd42a8db2da3caedb565c5d43287aee2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:518-529 | packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:534-545 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:629-640 | packages/microsandbox-types/rust/lib/snapshot/manifest.rs:721-730 \u2014 before extracting anything, compare \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs\u0060 and \u0060packages/microsandbox-types/rust/lib/snapshot/manifest.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs:518\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":"packages/microsandbox-types/rust/lib/snapshot/cloud_manifest.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0d04ebca5d319ff65c81a8f409fd811147d0592d885cb415aff36f8fb3582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/agentd/lib/session.rs:1700-1710 | crates/agentd/lib/session.rs:1778-1788 \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 \u0060crates/agentd/lib/session.rs:1700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b627a527e05f3f800abdba4cd1ab2a38dee70b1123fb950e54a8f3faa1fa94dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/lib/client/ipc.rs:792-802 | crates/runtime/lib/client/ipc.rs:827-837 \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 \u0060crates/runtime/lib/client/ipc.rs:792\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ea122d792ae59c0c2ec1ec89673cb1d485434e83b51370b479f04f8ac49815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/node-ts/native/mount_builder.rs:228-238 | sdk/node-ts/native/root_disk_builder.rs:87-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5657171a02cec27da58ba0d33f5601e5c798314ce227da0e17961e3c34a9872a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/network/lib/proxy/socks.rs:104-114 | crates/network/lib/proxy/socks.rs:151-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/proxy/socks.rs:104\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/proxy/socks.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"badf34aa7802101ac93c3b79a3197ebccd2222679baa77d664b22cb74538369b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/backend/cloud/http.rs:258-267 | sdk/rust/lib/backend/cloud/http.rs:277-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/backend/cloud/http.rs:258\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/cloud/http.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c546180b199fd9d9cfa2ce1de2d7ae677aaa0a25e145f8174af31e9642c8a017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/agentd/lib/session.rs:1699-1708 | crates/agentd/lib/session.rs:1737-1746 | crates/agentd/lib/session.rs:1777-1786 \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 \u0060crates/agentd/lib/session.rs:1699\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/session.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6186f74a3c7eb91b92b3ca44ac953c79a013458bfd038b2c10ef5214002a8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/commands/common.rs:790-799 | crates/cli/lib/commands/common.rs:843-850 \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 \u0060crates/cli/lib/commands/common.rs:790\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce8e2d85daf9c95a3902d9d00264d7dc8f554818631e8fdb19c7c33fe2f939e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/migration/lib/m20260710_000001_migrate_root_disk.rs:67-76 | crates/migration/lib/m20260710_000001_migrate_root_disk.rs:96-105 | crates/migration/lib/m20260922_000001_migrate_secret_config.rs:54-62 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/migration/lib/m20260710_000001_migrate_root_disk.rs:67\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":"crates/migration/lib/m20260710_000001_migrate_root_disk.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e034a2e565e6f63d5a20dfcf2f1ab549e22b8396c029ecd6238ec89135418eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/image/lib/cache/lock.rs:93-102 | crates/image/lib/storage_lease.rs:705-712 \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 \u0060crates/image/lib/cache/lock.rs:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"crates/image/lib/cache/lock.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee804bbc8d1eb8b25fec315ef5c249e4cc20b23c2dd8c97172111c9e25d7380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/archive/delta.rs:512-521 | sdk/rust/lib/backend/local/snapshot/archive/delta.rs:853-862 \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 \u0060sdk/rust/lib/backend/local/snapshot/archive/delta.rs:512\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":"sdk/rust/lib/backend/local/snapshot/archive/delta.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"819aca8a9e59dd21d6a81082fc44447a8b40589deb23c88b3cef2cc51f8df1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/create.rs:350-359 | sdk/rust/lib/backend/local/snapshot/create.rs:900-906 \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":"sdk/rust/lib/backend/local/snapshot/create.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"8114e9f94994a4e525db3f7b4001a6fa32da78648d762c596726facdb7f38268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/runtime/lib/runner/relay.rs:948-956 | crates/runtime/lib/runner/relay.rs:990-998 \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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd012efbf36f9c7a81df4f5ace42b0460f17db369de09e24c555fa3c6180438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/lib/commands/self_cmd.rs:1214-1222 | crates/cli/lib/commands/self_cmd.rs:1274-1282 \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 \u0060crates/cli/lib/commands/self_cmd.rs:1214\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baf8ad2ee4aa09e81e9c56d7545acca10d4e8cc78cc0b6493b2d4b917a44559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/agentd/lib/config.rs:1013-1021 | crates/agentd/lib/config.rs:1405-1413 \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 \u0060crates/agentd/lib/config.rs:1013\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":"crates/agentd/lib/config.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9f53cadc7e032a467ea19c9085f813231b8de61a4d0c08c91ce1190285bce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): sdk/rust/lib/backend/local/snapshot/archive/owned.rs:44-52 | sdk/rust/lib/backend/local/snapshot/create.rs:1701-1709 | sdk/rust/lib/backend/local/snapshot/verify.rs:111-119 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/rust/lib/backend/local/snapshot/archive/owned.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/snapshot/archive/owned.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ccde477533e4437d0ec6bc6c36577dc29f4fc30c009fc8baf68204774b1f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/agentd/lib/config.rs:807-814 | crates/agentd/lib/config.rs:903-911 \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 \u0060crates/agentd/lib/config.rs:903\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/config.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"739efcadfafb3392956179dbba8ffc32733f9522c400530d721b067d41f242b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:2210-2218 | crates/runtime/lib/runner/vm.rs:2349-2356 \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 \u0060crates/runtime/lib/runner/vm.rs:2210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1899a5891bf063836b94043226a452be228de5d9a26a53a73da87f67ddf7242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/runtime/lib/client/compat/v0_5_9/launch.rs:88-96 | crates/runtime/lib/client/compat/v0_5_9/launch.rs:101-109 \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 \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:88\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:99\u0060 calls \u0060into\u0060 and \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:86\u0060 does not \u2014 after which the two agree again for 3 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":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1693726a19a51b78a4bd780ab5c14a3b7f6d9eecec691a3d083f33efad270d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/network/lib/engine/icmp/relay.rs:621-629 | crates/network/lib/engine/icmp/relay.rs:668-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/network/lib/engine/icmp/relay.rs:621\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":"crates/network/lib/engine/icmp/relay.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f18e05dd14550ab2f7e02ab1625ee6cbe58361e8a0331b1d5cd47a3bf82dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/agentd/lib/config.rs:806-813 | crates/agentd/lib/config.rs:848-855 | crates/agentd/lib/config.rs:902-909 \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 \u0060crates/agentd/lib/config.rs:806\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":"crates/agentd/lib/config.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"9650cc7c69ee082861b777d479757684177d0e122701f5886db3563cd28c0eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/network/lib/engine/dns/forwarder.rs:621-628 | crates/network/lib/engine/dns/forwarder.rs:643-650 \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 \u0060crates/network/lib/engine/dns/forwarder.rs:621\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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9a0b8fff63fd1296687af253ccd519e749f65d4de3cf910b575dae433e8994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/lib/sandbox_config.rs:1635-1642 | crates/cli/lib/sandbox_config.rs:1646-1653 \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 \u0060crates/cli/lib/sandbox_config.rs:1635\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05fd1636d2762b6a561282bbc15aeabfc6e17528d5682c90ca3870fecfe0ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs:189-196 | crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs:181-188 \u2014 \u0060crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs\u0060 and \u0060crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 44 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/owned_mobility.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"25af4eebd09813b1425e3532492b134134df44439a90ce55a2ce8dcf15d3bc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/network/lib/engine/http_deny.rs:77-84 | crates/network/lib/engine/http_deny.rs:103-110 \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 \u0060crates/network/lib/engine/http_deny.rs:77\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":"crates/network/lib/engine/http_deny.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38aa1ec2ff094c14e4d35899dd57adc066839830101589e5fc377bc1c1f1c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/runtime/lib/runner/vm.rs:2622-2629 | crates/runtime/lib/runner/vm.rs:2633-2640 | crates/runtime/lib/runner/vm.rs:2673-2680 \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 \u0060crates/runtime/lib/runner/vm.rs:2622\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20cdfaffaa057d8912c06a76768f903f87dca04670fc15be50be875e621dd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/runtime/lib/client/compat/v0_5_9/launch.rs:89-96 | crates/runtime/lib/client/compat/v0_5_9/launch.rs:102-109 | crates/runtime/lib/client/compat/v0_5_9/launch.rs:115-122 \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 \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:89\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:99\u0060 calls \u0060into\u0060 and \u0060crates/runtime/lib/client/compat/v0_5_9/launch.rs:86\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":"crates/runtime/lib/client/compat/v0_5_9/launch.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91e76231d962f5b0c6e6c70470c4484b2331b5899c7455493732060bbdd0622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/go/native/src/lib.rs:5437-5443 | sdk/go/native/src/lib.rs:5598-5604 \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 \u0060sdk/go/native/src/lib.rs:5437\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6b720d15f2988bf0fd6bc5a60c0db5332d0a9826d40519ac15f08aec3a322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/python/src/helpers.rs:702-708 | sdk/python/src/helpers.rs:783-789 \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 \u0060sdk/python/src/helpers.rs:702\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":"sdk/python/src/helpers.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba1c1faa21e266767e6abe91f97d8d67a5ff18fbe8d847ce6168b76c3dd213e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/runtime/lib/client/ipc.rs:113-119 | crates/runtime/lib/client/ipc.rs:494-500 | crates/runtime/lib/client/ipc.rs:627-633 | crates/runtime/lib/client/ipc.rs:673-679 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"72787c1e511cf0417f21bb79855ed577439166ee1d15f1dc9ea8a698d59e550e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/owned_unix.rs:136-142 | crates/filesystem/lib/backends/passthroughfs/owned_unix.rs:202-208 \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 \u0060crates/filesystem/lib/backends/passthroughfs/owned_unix.rs:136\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":"crates/filesystem/lib/backends/passthroughfs/owned_unix.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e2b12f38b9e2782a524f7f3e008997983af6769c2aaed395b042f5261000e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/node-ts/native/mount_builder.rs:381-387 | sdk/node-ts/native/mount_builder.rs:391-397 \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 \u0060sdk/node-ts/native/mount_builder.rs:381\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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fb5d74a45cb0ce1931e1f85744556c89baf56ef4d5ba415e2605e024d28fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/lib/commands/snapshot.rs:408-414 | sdk/go/native/src/lib.rs:6637-6643 \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 \u0060crates/cli/lib/commands/snapshot.rs:408\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":"crates/cli/lib/commands/snapshot.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09470d15945d97c2b20c4baf9f48aa272ca657378237ecfd8472776b24fb9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): sdk/python/src/volume.rs:222-228 | sdk/python/src/volume.rs:260-266 | sdk/python/src/volume.rs:288-294 | sdk/python/src/volume.rs:324-330 \u2014 all 4 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/python/src/volume.rs:229\u0060 calls \u0060set_mount_metadata_options\u0060 and \u0060sdk/python/src/volume.rs:295\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":"sdk/python/src/volume.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa4e762d6f0067f079acd970e40c9e97d4fe4a2fc322c64b2f9fb51e9ebf9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/lib/client/ipc.rs:306-312 | crates/runtime/lib/client/ipc.rs:344-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415c83b2730a1a0b3decf52267a7b1bf6b389ba8cb426d902015ab14a049f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/client/ipc.rs:524-530 | crates/runtime/lib/client/ipc.rs:544-550 \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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f438c7aa6d70f40442aced38a1e5ccda5ed012cbe2d3971ec2830711d6051f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/agentd/lib/network.rs:349-355 | crates/agentd/lib/network.rs:361-367 \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 \u0060crates/agentd/lib/network.rs:349\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060libc\u0060 to \u0060:AF_INET as u8\u0060 in one and \u0060:AF_INET6 as u8\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/network.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec550f502da5ac1073860c8fb1d177dfa5355ee332160b58288a578aec2a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/agentd/lib/fs.rs:580-586 | crates/agentd/lib/fs.rs:765-771 \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 \u0060crates/agentd/lib/fs.rs:765\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. 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":"crates/agentd/lib/fs.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef3d10b4f153baf93ee26c47ce4c6543a3e74bd842a478cc4abfb9802df5faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:719-725 | sdk/ruby/ext/microsandbox/src/lib.rs:732-738 \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 \u0060sdk/ruby/ext/microsandbox/src/lib.rs:719\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc3715db27e73dd2fbec6ec1517bbee367d928664760382a79cb25248d6b6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/lib/runner/cpu/allocation.rs:475-481 | crates/runtime/lib/runner/writeback/admission.rs:755-761 \u2014 before extracting anything, compare \u0060crates/runtime/lib/runner/cpu/allocation.rs\u0060 and \u0060crates/runtime/lib/runner/writeback/admission.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f4139fc46e0eb627b440b874c204aae3b13a23611c5387858b757b8faea921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:155-160 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:551-556 \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":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f424d32e8474a8b5fb3e9b5bc7a5c7e81dfd2372fc4ceffa3498e349bec0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:7489-7494 | sdk/go/native/src/lib.rs:7525-7530 \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 \u0060sdk/go/native/src/lib.rs:7489\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":7489}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bcfce5e9e6a2928308318bf491ab3c4e33bb6561d51f3787570546348ba908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/image/lib/ext4/resizer.rs:881-886 | crates/image/lib/ext4/resizer.rs:1131-1136 \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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a400c82810019193d23c71d57e16ae12ee0d879ed9bdb36d1f0048ae3b2127ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/filesystem/lib/backends/memfs/builder.rs:169-174 | crates/filesystem/lib/backends/shared/init_binary.rs:92-97 \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 \u0060crates/filesystem/lib/backends/memfs/builder.rs:169\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":"crates/filesystem/lib/backends/memfs/builder.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5013992dfbe5af37676c7fef491a41655ae7f2354fc863a1e14af08087eb9e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/agentd/lib/fs.rs:589-594 | crates/agentd/lib/fs.rs:660-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentd/lib/fs.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"805aa4efeb67c2cd990e71635f17ec018cbe517f7e514ba42fb1a6ce5f013fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:155-160 | crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs:551-556 | crates/filesystem/lib/backends/passthroughfs/windows/owned_mobility.rs:159-164 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfc7c8820d53cd3b2ed078860c361a2148e31f938004600041138ceefbe735e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/native/src/lib.rs:4433-4438 | sdk/go/native/src/lib.rs:4471-4476 \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 \u0060sdk/go/native/src/lib.rs:4433\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6722620412f9487d59550e3f469f525e7295d93002dc90621acd8769be31d758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/go/native/src/lib.rs:4582-4586 | sdk/go/native/src/lib.rs:4988-4992 \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 \u0060sdk/go/native/src/lib.rs:4582\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cee5979626b954df3541d6b73cec694954bf255697f59551e265540cc6c30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/runner/vm.rs:1150-1154 | crates/runtime/lib/runner/vm.rs:1664-1668 \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 \u0060crates/runtime/lib/runner/vm.rs:1150\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"871576cbbacd7b8282c9be38c2a9d66fab223b929e2585ca7f0a6ff4e4f83e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/image/lib/checkpoint/store.rs:126-130 | crates/image/lib/checkpoint/store.rs:250-254 \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 \u0060crates/image/lib/checkpoint/store.rs:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/lib/checkpoint/store.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"911170eba57f4003c653894bd03026357479bd53ba014f72ea9ace4b2e00cda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/jobs.rs:108-112 | sdk/python/src/jobs.rs:97-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/node-ts/native/jobs.rs:108\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":"sdk/node-ts/native/jobs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b20dfcab17f4f9adcd2a378b00277eb661a1023d5d33d05c9d320525851992c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/node-ts/native/sandbox.rs:1285-1289 | sdk/node-ts/native/sandbox.rs:1298-1302 \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 \u0060sdk/node-ts/native/sandbox.rs:1285\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/node-ts/native/sandbox.rs:1283\u0060 calls \u0060modify_port_number\u0060 and \u0060sdk/node-ts/native/sandbox.rs:1296\u0060 does not \u2014 after which the two agree again for 3 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":"sdk/node-ts/native/sandbox.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbcc510594394910bd9cfca24e07d41f882b17246bcfb621ff81369c362bb77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/filesystem/lib/backends/memfs/file_ops.rs:98-102 | crates/filesystem/lib/backends/memfs/special.rs:86-90 \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 \u0060crates/filesystem/lib/backends/memfs/file_ops.rs:98\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":"crates/filesystem/lib/backends/memfs/file_ops.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0507fe511ebff6906a439a4bb587ab84cab6b8bc381a98c3c78a51f0bbbe8a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:121-125 | crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs:381-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebbc794efccad3cf75935d88f552bdcb5305530c79e3911a80515ad6c5629de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/lib/checkpoint/compat/v0_7_0/journal.rs:110-114 | crates/runtime/lib/checkpoint/owned_disk.rs:142-146 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/runtime/lib/checkpoint/owned_disk.rs:147\u0060 calls \u0060is_none\u0060 and \u0060crates/runtime/lib/checkpoint/compat/v0_7_0/journal.rs:115\u0060 does not \u2014 after which the two agree again for 3 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":"crates/runtime/lib/checkpoint/compat/v0_7_0/journal.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98ff4c837ef2be1a09b2ae2e0e42273c292178f44f23e494c9fbd81179410a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/agent-client/rust/lib/optimized.rs:611-616 | packages/agent-client/rust/lib/optimized.rs:627-632 \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1828e44d78cdf946caf043cd5656d2dac267314ff648889253bb62ee7e3063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/node-ts/native/image.rs:249-256 | sdk/node-ts/native/image.rs:285-292 \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":"sdk/node-ts/native/image.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3610dba177a1f5e79dbc244398794aa65046c2758e5f7c2a3d6a221832a7d688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/python/src/sandbox.rs:370-374 | sdk/python/src/sandbox.rs:436-440 \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":"sdk/python/src/sandbox.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6610b2fbedf3de5f5af2fd53c1a24425e2681d3582143eaf37793168f978343e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:1732-1737 | sdk/ruby/ext/microsandbox/src/lib.rs:1753-1758 \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 \u0060sdk/ruby/ext/microsandbox/src/lib.rs:1732\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7331dfd8c883db82644e8fe52aa77f876fc2482037f22a639e0afa3822541810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): sdk/ruby/ext/microsandbox/src/lib.rs:2277-2281 | sdk/ruby/ext/microsandbox/src/lib.rs:2328-2332 | sdk/ruby/ext/microsandbox/src/lib.rs:2378-2382 | sdk/ruby/ext/microsandbox/src/lib.rs:2435-2439 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d18a53332253c17c419b784aefcb26d36edf3b7fc11c0931069dcc3b31cb1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:2289-2293 | sdk/ruby/ext/microsandbox/src/lib.rs:2351-2355 \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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"324c2ff7f25cc3e09dff7b9d3c3aeeb5aa0b3ee66d568c89e8825737c52f9130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/ruby/ext/microsandbox/src/lib.rs:2642-2646 | sdk/ruby/ext/microsandbox/src/lib.rs:2658-2662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/ruby/ext/microsandbox/src/lib.rs:2663\u0060 calls \u0060aset\u0060 and \u0060sdk/ruby/ext/microsandbox/src/lib.rs:2647\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"307416c074e0308bfe6cb3ffaf493cb8aecac7576d62fe04c4274797abc4e1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/backend/local/snapshot/lineage.rs:120-124 | sdk/rust/lib/backend/local/snapshot/lineage.rs:153-157 \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":"sdk/rust/lib/backend/local/snapshot/lineage.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba57132abe45ec04095bbfaf2a280f789805549eb844281650115d0ccdddb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/backend/local/volume.rs:281-285 | sdk/rust/lib/volume/mod.rs:623-627 \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 \u0060sdk/rust/lib/backend/local/volume.rs:281\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, \u0060sdk/rust/lib/backend/local/volume.rs:280\u0060 calls \u0060from\u0060 and \u0060sdk/rust/lib/volume/mod.rs:622\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":"sdk/rust/lib/backend/local/volume.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"817f6da18888a6cc898a51b03dbc50c6af313faa95c35f22c9b4a2f92df2d0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/go/fs.go:68-74 | sdk/go/volume.go:235-241 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/fs.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc066ca88930d166c7e4ac68bc7b2c85b1ecf0f2a7c23f7d1a9b6a150243a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): sdk/go/image.go:25-31 | sdk/go/image.go:48-54 | sdk/go/snapshot.go:455-461 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/image.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d26961ef9ea9ececd954208e63cbf53cc326d4bab40e666786527359a51d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/go/storage_diagnosis.go:88-93 | sdk/go/storage_recovery.go:48-53 \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 \u0060sdk/go/storage_diagnosis.go:88\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":"sdk/go/storage_diagnosis.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"936fd96240322481cfac14415df9a6c314625eb66bc41fde09547efe4f3cb8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): sdk/rust/lib/sandbox/attach.rs:542-699 | sdk/rust/lib/sandbox/attach.rs:730-854 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3b29759863ec08c4a11f42304cbeb8b9c0b3e69140c719f4de7bad76eef6a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): sdk/go/examples/basic/main.go:22-103 | sdk/go/examples/detached/main.go:27-115 | sdk/go/examples/disk/main.go:30-124 | sdk/go/examples/errors/main.go:26-107 | sdk/go/examples/filesystem/main.go:25-202 | sdk/go/examples/image-cache/main.go:30-126 | sdk/go/examples/metrics/main.go:26-86 | sdk/go/examples/network/main.go:29-103 | sdk/go/examples/patches/main.go:24-99 | sdk/go/examples/ports/main.go:29-85 | sdk/go/examples/secrets/main.go:28-86 | sdk/go/examples/snapshot-fork/main.go:23-108 | sdk/go/examples/streaming/main.go:22-64 | sdk/go/examples/tls/main.go:29-97 | sdk/go/examples/volumes/main.go:20-86 \u2014 These 15 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 15 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 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/examples/basic/main.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae204097b727495defab36b6d67270b8912082b2e7128b86df65cd9b81e8e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): sdk/rust/lib/sandbox/fs.rs:1146-1167 | sdk/rust/lib/sandbox/fs.rs:1169-1189 | sdk/rust/lib/sandbox/fs.rs:1331-1351 | sdk/rust/lib/sandbox/fs.rs:1356-1376 | sdk/rust/lib/sandbox/fs.rs:1455-1478 | sdk/rust/lib/sandbox/fs.rs:1586-1610 | sdk/rust/lib/sandbox/fs.rs:1636-1659 | sdk/rust/lib/sandbox/fs.rs:1684-1707 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b394f2834cb102af8e5f3eee40a06199688817be5e9cdcd06a09f7775a70dc49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): scripts/smoke/cli/legacy_storage_preview.py:264-286 | scripts/smoke/cli/legacy_storage_repair.py:289-314 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d9205b06bf615180b2abf8ca7698ca27e3a42f5cc0f036fc1dd00a4c035f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): sdk/rust/lib/backend/local/sandbox/create.rs:2002-2043 | sdk/rust/lib/backend/local/sandbox/mod.rs:1010-1048 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2dcc55148261af98ec6833afee2a61e841c20882f1e34aed2700e97c21c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): scripts/smoke/cli/checkpoint-integration.py:55-78 | scripts/smoke/cli/managed-job-integration.py:69-97 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"scripts/smoke/cli/checkpoint-integration.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"db889d8f985a13cce2a327b943331995eec2f8770e1d3a6a98f212f3764dd58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): scripts/smoke/cli/catalog-history.py:26-41 | scripts/smoke/cli/previous_release_upgrade.py:86-110 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"scripts/smoke/cli/catalog-history.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"268662f6d84be2ce6f454946f6a7880af14a8932a6fe4404837b9afb605e8edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): packages/microsandbox-types/rust/lib/cloud/specs.rs:296-345 | packages/microsandbox-types/rust/lib/cloud/specs.rs:349-398 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"packages/microsandbox-types/rust/lib/cloud/specs.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc6cea3dd1e046baf03b100cfbe084a4888f651fe069b3a6bff38f3bc9fdc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): examples/python/root-bind/main.py:11-37 | examples/python/root-block/main.py:11-37 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/root-bind/main.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c7e12c3fc24c97aa5533ce8e286b5c0b6dfdc0f7ce41a921420755d439afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): packages/microsandbox-types/rust/lib/cloud/specs.rs:527-598 | packages/microsandbox-types/rust/lib/cloud/specs.rs:602-671 \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":"packages/microsandbox-types/rust/lib/cloud/specs.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6b6291247ee193a6ac931709bc7d28de05075612c6261e492460277223cea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): sdk/rust/lib/sandbox/fs.rs:1221-1265 | sdk/rust/lib/sandbox/fs.rs:1288-1325 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53637a5e44de1651ed6a464b5ed892c5b5ca854f1b6d0c23dcf6c2bed3b1586"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/smoke/cli/checkpoint-clock.py:22-31 | scripts/smoke/cli/checkpoint-cpu-state.py:22-31 \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":"scripts/smoke/cli/checkpoint-clock.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d858eaa73c30627fd314726b65a4f927928f2b6c6475ab4458af1d56e371040a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/smoke/cli/direct-branch.py:22-32 | scripts/smoke/cli/incremental-full-archive.py:27-37 \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":"scripts/smoke/cli/direct-branch.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce93baf7e023b24a5c95c43054b82feea100874c3a94b19b322b5ad63e232d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): scripts/smoke/cli/bounded-root-grow.py:26-36 | scripts/smoke/cli/checkpoint-managed-volumes.py:28-38 | scripts/smoke/cli/checkpoint-memory-growth.py:28-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"scripts/smoke/cli/bounded-root-grow.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"12984716b1edc2b79130d96d91fc05df8f4c8a765afd1a180d888c7bb07e12fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): sdk/rust/lib/sandbox/builder.rs:731-756 | sdk/rust/lib/sandbox/builder.rs:766-797 \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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f01550fb9d91db89ea0060354231dffb35fa3b026b097077ecb19cdc484678b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): sdk/rust/lib/sandbox/flat_rootfs.rs:65-88 | sdk/rust/lib/sandbox/upper.rs:45-68 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"sdk/rust/lib/sandbox/flat_rootfs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4a215422214560e870c4172f148bc14a044c3b046faa6c21a72b76803529e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/backend/local/sandbox/mod.rs:1056-1069 | sdk/rust/lib/backend/local/sandbox/mod.rs:1132-1148 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/backend/local/sandbox/mod.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a68ba1c1bea828cf0b2cd80472722b2b99858d41bebbddfd21a9dff4f875a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/sandbox/modify/builder.rs:225-236 | sdk/rust/lib/sandbox/modify/builder.rs:300-311 \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":"sdk/rust/lib/sandbox/modify/builder.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76e0cb43364ec27994fa8d4f2c60ddde53df1788faabf873245aa79ff1a380e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/smoke/cli/checkpoint-shared-resources.py:44-52 | scripts/smoke/cli/stop-activation-live.py:43-50 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/checkpoint-shared-resources.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9e4db30e7585bce7b814412532db5c412591622c0ddf2640b9238030037db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/sandbox/builder.rs:324-335 | sdk/rust/lib/sandbox/builder.rs:367-379 \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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c0f8ca49b8fb3c69dc322a8dd8347c8c5d3a9bafc6238d534120a7e2da2647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/rust/lib/sandbox/builder.rs:1784-1793 | sdk/rust/lib/sandbox/builder.rs:1803-1811 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f72da63ab4d8d38ba48da08ed465713d5da574193ae6c2556b7b8e216ea93df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): sdk/rust/lib/sandbox/mod.rs:1337-1354 | sdk/rust/lib/sandbox/mod.rs:1361-1376 | sdk/rust/lib/sandbox/mod.rs:1382-1399 | sdk/rust/lib/sandbox/mod.rs:1406-1421 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ed5ba284ec7c01388bcbbf6b5553fdbde4e52753cb6d298a59c196fcd7d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:1608-1620 | sdk/rust/lib/sandbox/ssh.rs:1797-1810 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7649d37fd2e1bb4eeacf5b2eb56b617ae3b37894073c9d4b56425d704b2999f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/ci/validate-release-artifacts.py:102-110 | scripts/ci/validate-release-artifacts.py:114-126 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/validate-release-artifacts.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae3e182abef93c899f28e45e32602e77a372c7d030ec1e2ae7b36845ccfff76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): sdk/rust/lib/sandbox/builder.rs:692-710 | sdk/rust/lib/sandbox/builder.rs:802-817 | sdk/rust/lib/sandbox/builder.rs:952-970 | sdk/rust/lib/sandbox/builder.rs:977-991 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a779af3ef3e0d15445094c2781b2ce04efc0145b272a3c5c25a263f5a042ce8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:1708-1723 | sdk/rust/lib/sandbox/ssh.rs:1729-1742 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c673ba3c8a76e51477f3694ca032edeafd34fc279bdff9aa0a4a055c872da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sdk/rust/lib/sandbox/init.rs:121-141 | sdk/rust/lib/sandbox/init.rs:152-174 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"sdk/rust/lib/sandbox/init.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5729865c6c4fd98ec243b676abdf7c41a3abb4c7c94d44c9293a0a82162c8b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sdk/rust/lib/sandbox/mod.rs:1241-1256 | sdk/rust/lib/sandbox/mod.rs:1290-1305 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2212d7e21e41ce7b8d88e04392bbcd338b17b0b4248d39cb122ac2dad173b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:1148-1163 | sdk/rust/lib/sandbox/ssh.rs:1165-1177 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"863c6896b7aaa23e2fef655fb0103d8b2c3f5449d120706ffdefb0a4088325ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:1999-2012 | sdk/rust/lib/sandbox/ssh.rs:2118-2130 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4941bfa0ffd7b11379c78ca4cc4bacd940536efef9a40d9b4754edde489e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): sdk/rust/lib/sandbox/mod.rs:1186-1201 | sdk/rust/lib/sandbox/mod.rs:1215-1230 | sdk/rust/lib/sandbox/mod.rs:1441-1454 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4209df3a75a37833fd0cfb8b56c3707fa22c3f38f0802ba422636a5dae160f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:2191-2200 | sdk/rust/lib/sandbox/ssh.rs:2226-2235 \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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a98c97555e4bdff54c8c5070fbd13085bd06092a10f1142ed9e15f702634ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): scripts/smoke/cli/catalog-history.py:47-53 | scripts/smoke/cli/legacy_storage_migration.py:59-62 | scripts/smoke/cli/managed-job-integration.py:34-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"scripts/smoke/cli/catalog-history.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cd074a7300b3ef61b98a5baa6efb4f25c1458a3ed82203ff828e769e5511eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/sandbox/fs.rs:894-905 | sdk/rust/lib/sandbox/fs.rs:908-920 \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":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b720d13c4ad35ac97a647d9f53064e2557843a93cf62b16c13d8b93f3a8c5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sdk/rust/lib/backend/local/sandbox/create.rs:2046-2061 | sdk/rust/lib/sandbox/reap.rs:109-120 \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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6caa03a8d7827b4e20607ad33a0f3dbc6e4c29cfc15455c4ea5f7ed08f227d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): sdk/rust/lib/sandbox/fs.rs:1484-1496 | sdk/rust/lib/sandbox/fs.rs:1503-1517 | sdk/rust/lib/sandbox/fs.rs:1524-1535 | sdk/rust/lib/sandbox/fs.rs:1542-1553 | sdk/rust/lib/sandbox/fs.rs:1560-1571 | sdk/rust/lib/sandbox/fs.rs:1618-1630 | sdk/rust/lib/sandbox/fs.rs:1666-1678 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 12 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"20362c93c9de33a71d5f1216a418a657ff65ef62c349f63f4c460b7e9b9b5a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): sdk/rust/lib/sandbox/handle.rs:747-758 | sdk/rust/lib/sandbox/handle.rs:766-777 | sdk/rust/lib/sandbox/handle.rs:800-811 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc862f42b8536312549d9ec23cde7b4a2aa63fc79415c451420bae65e2e37f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/rust/lib/sandbox/ssh.rs:2207-2220 | sdk/rust/lib/sandbox/ssh.rs:2242-2257 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00912318d2bb4a1ff47cacc712aaa9fd95e42c00a3bc65ad18cedad3e11c91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk/rust/lib/sandbox/fs.rs:1272-1279 | sdk/rust/lib/sandbox/ssh.rs:2982-2996 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"390e4e79edd76e4ea12635cf76e41dbfb8e8b471048eab8e6f7a9b4676452393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/smoke/cli/checkpoint-integration.py:84-87 | scripts/smoke/cli/managed-job-integration.py:100-103 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"scripts/smoke/cli/checkpoint-integration.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"492984768ba755fa305f7fdd374fa9cbd1be199da97f77133e5269e5bc355f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sdk/rust/lib/sandbox/builder.rs:199-211 | sdk/rust/lib/sandbox/builder.rs:1192-1205 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"df322fad93228ef20c75e9e4c493c34bc835efb7e3efa3f8b829ef1b0da59e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/smoke/cli/stop-activation-live.py:77-83 | scripts/smoke/cli/stop-activation-live.py:88-91 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"scripts/smoke/cli/stop-activation-live.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ca6260370da93c75c31d080c1bd4ac84b4f33c6e7ad04f8bda5aa6bd33e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sdk/rust/lib/sandbox/modify/local.rs:727-737 | sdk/rust/lib/sandbox/modify/local.rs:743-753 | sdk/rust/lib/sandbox/modify/local.rs:763-780 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"sdk/rust/lib/sandbox/modify/local.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9189926b97a8621c483fedff90f892ace6dab36a25d1cc318b04a47127f6a7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/smoke/managed-job-terminal.py:30-35 | scripts/smoke/managed-jobs-lifecycle.py:15-18 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"scripts/smoke/managed-job-terminal.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1626c523fc743a9abbaa27aeddc8dc4c9669e478b56033ca14106abb1e32f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/smoke/cli/root-disk-large-growth.py:72-76 | scripts/smoke/cli/transport-checkpoint.py:173-177 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"scripts/smoke/cli/root-disk-large-growth.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c3bbd9cb75dffcd06351db9bf54ec4f7069b8d6b398ee7476819c82322e421"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/rust/lib/sandbox/handle.rs:205-210 | sdk/rust/lib/sandbox/mod.rs:677-682 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"79320e2e3b10f72c8385aa4b6152b2726826c720c8031097de3b5a27df52a099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/rust/lib/sandbox/handle.rs:735-744 | sdk/rust/lib/sandbox/mod.rs:963-972 \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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6fab6263553b2061a61ad885702b357aede64b57416fb99455ef06b3a118b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): sdk/rust/lib/sandbox/init.rs:80-84 | sdk/rust/lib/sandbox/mod.rs:544-551 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"sdk/rust/lib/sandbox/init.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c736c705d7553020e407b7bdebaa13cb0e08c9600c95821d77cf4f51d18d6497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk/rust/lib/sandbox/handle.rs:722-731 | sdk/rust/lib/sandbox/mod.rs:933-942 \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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bd953a4dd5c8d1291d4788df354db70410a653659277c045e2356babf78ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/rust/lib/sandbox/handle.rs:479-484 | sdk/rust/lib/sandbox/mod.rs:1002-1007 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aec017e3645f9003a3f0e88ad6a4a298956a49a029dbbb58427a09eaea5fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sdk/rust/lib/sandbox/handle.rs:495-500 | sdk/rust/lib/sandbox/mod.rs:1033-1038 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"019edda8475863d2092e5445973e5da07b863e982fd1dab25a852b44d3a21206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sdk/rust/lib/sandbox/handle.rs:323-326 | sdk/rust/lib/sandbox/mod.rs:710-713 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"sdk/rust/lib/sandbox/handle.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"56774ce36afecd4073723e1057114bc81faf64168932fefcdd18c813414577d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): sdk/rust/lib/sandbox/ssh.rs:720-742 | sdk/rust/lib/sandbox/ssh.rs:812-834 \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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0cdfdab56094925d98992d9a5faf67bcc2f1851564fed9d5e405eff8f33ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:651-670 | sdk/rust/lib/sandbox/attach.rs:814-833 \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 \u0060sdk/rust/lib/sandbox/attach.rs:651\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/rust/lib/sandbox/attach.rs:672\u0060 calls \u0060flush\u0060 and \u0060sdk/rust/lib/sandbox/attach.rs:835\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":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e9c01bcd1f83d2eaff8ac24cf52e85bb1de18332ebb81db9b318b89911fb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): sdk/rust/lib/sandbox/mod.rs:1610-1629 | sdk/rust/lib/sandbox/ssh.rs:3176-3195 \u2014 before extracting anything, compare \u0060sdk/rust/lib/sandbox/mod.rs\u0060 and \u0060sdk/rust/lib/sandbox/ssh.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a7c79c805707e6863bf949a01b04a3a350700a677b468f9faecb2c7586bfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:624-642 | sdk/rust/lib/sandbox/attach.rs:787-805 \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 \u0060sdk/rust/lib/sandbox/attach.rs:624\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":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"74af290d2ccf73b852c57f03467e49476d1038f37b6ca0289f93d3d2a4826f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sdk/rust/lib/sandbox/patch.rs:808-825 | sdk/rust/lib/sandbox/patch.rs:832-849 \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 \u0060sdk/rust/lib/sandbox/patch.rs:808\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/patch.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae7b4608f9d3b3d7256b2bc2b11ba2f35bab5c2cac92db72e64384d77df1780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sdk/rust/lib/sandbox/mod.rs:1764-1779 | sdk/rust/lib/sandbox/mod.rs:1808-1823 \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 \u0060sdk/rust/lib/sandbox/mod.rs:1764\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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952be51ed3972d8fc40349bc240d1ca81131fe4a4654d0b4858ded9b116543f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:554-568 | sdk/rust/lib/sandbox/attach.rs:742-755 \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":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a300898ef295cbb1e80d9f83fa442c38a37424fdaf62d1463c1eaf0567eac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sdk/rust/lib/sandbox/fs.rs:1337-1351 | sdk/rust/lib/sandbox/fs.rs:1464-1478 \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 \u0060sdk/rust/lib/sandbox/fs.rs:1337\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":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"216381520871cbc015984c152ba3bb9dc7bcea58ab03b961a09a7a7a1b396c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): sdk/rust/lib/sandbox/builder.rs:697-710 | sdk/rust/lib/sandbox/builder.rs:784-797 | sdk/rust/lib/sandbox/builder.rs:957-970 \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 \u0060sdk/rust/lib/sandbox/builder.rs:697\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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ff0651f3da30d6eb6488adc3d3e8b467eed3d1eb080fd125266f9ce5b12f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sdk/rust/lib/sandbox/mod.rs:1338-1351 | sdk/rust/lib/sandbox/mod.rs:1383-1396 \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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ecf69c654c156774920bd06ee8c91e1f8b1e402c402692d52fe4ca0f76df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 8): sdk/rust/lib/sandbox/fs.rs:1151-1161 | sdk/rust/lib/sandbox/fs.rs:1173-1183 | sdk/rust/lib/sandbox/fs.rs:1334-1345 | sdk/rust/lib/sandbox/fs.rs:1359-1370 | sdk/rust/lib/sandbox/fs.rs:1460-1472 | sdk/rust/lib/sandbox/fs.rs:1592-1604 | sdk/rust/lib/sandbox/fs.rs:1641-1653 | sdk/rust/lib/sandbox/fs.rs:1689-1701 \u2014 all 8 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 \u0060sdk/rust/lib/sandbox/fs.rs:1151\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":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6e4227a7cec8346d6e45acba6211107dd545e4928d49ef50dee95485b42ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): sdk/rust/lib/sandbox/patch.rs:809-821 | sdk/rust/lib/sandbox/patch.rs:833-845 | sdk/rust/lib/sandbox/patch.rs:887-899 \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 \u0060sdk/rust/lib/sandbox/patch.rs:809\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/patch.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"324a7e1819ab7dc78eec7c07ac60d761527793f74309aec7c930db0968312445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/rust/lib/sandbox/mod.rs:1635-1647 | sdk/rust/lib/sandbox/ssh.rs:3199-3211 \u2014 before extracting anything, compare \u0060sdk/rust/lib/sandbox/mod.rs\u0060 and \u0060sdk/rust/lib/sandbox/ssh.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4229705fbe4c44addfcd29c1168d481a55ae2ad095a6ccd9f3f0fadfa7ed67eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/rust/lib/sandbox/mod.rs:1362-1373 | sdk/rust/lib/sandbox/mod.rs:1407-1418 \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":"sdk/rust/lib/sandbox/mod.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd48e4078e04bd337d3ff831f79317b46742b25f99f4ff0b1cb86fffcc8ba34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/create.rs:2003-2013 | sdk/rust/lib/backend/local/sandbox/mod.rs:1011-1019 \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 \u0060sdk/rust/lib/backend/local/sandbox/create.rs:2003\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/rust/lib/backend/local/sandbox/create.rs:2014\u0060 calls \u0060value\u0060 and \u0060sdk/rust/lib/backend/local/sandbox/mod.rs:1019\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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac8bdd0c82fee4fd1de885158a37295331358f0a1a518e043b51341dae0c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/mod.rs:161-171 | sdk/rust/lib/backend/local/sandbox/stop.rs:133-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/sandbox/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65986444bc6b3e13dc760decbfc143e02ab16e0c3dc51c7b2f6130d4f8553a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/mod.rs:757-767 | sdk/rust/lib/backend/local/sandbox/mod.rs:823-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/sandbox/mod.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3e23c29e2846459b4e17eead412476da6851e53e34259e2c14d99acc2d60fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/rust/lib/sandbox/builder.rs:807-817 | sdk/rust/lib/sandbox/builder.rs:981-991 \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 \u0060sdk/rust/lib/sandbox/builder.rs:807\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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4446d71768226a6a04e82877ddff31d00a145f9b4582fe62fccbdf0701f15926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/create.rs:2083-2091 | sdk/rust/lib/sandbox/modify/local.rs:1244-1253 \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 \u0060sdk/rust/lib/backend/local/sandbox/create.rs:2083\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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d118d28d35ab302892d7ebd50f5406b8b07ad3a8665c64dfbb87eafaaf393c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/create/cleanup.rs:116-123 | sdk/rust/lib/sandbox/compact.rs:132-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/sandbox/create/cleanup.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3fae4f9c5f59eb0b10117b8790772be9c8e2f4bb53680349d19919aa658029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:543-550 | sdk/rust/lib/sandbox/attach.rs:731-738 \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":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bce5e9bd36e7e38cdfc7b8720fb31b852f38f076558e81762de629898674e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/rust/lib/sandbox/ssh.rs:1712-1719 | sdk/rust/lib/sandbox/ssh.rs:1731-1738 \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 \u0060sdk/rust/lib/sandbox/ssh.rs:1712\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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7be02902f19d261782690703261c08ebab85e6e3180fa3fd74b5090213bc260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/create.rs:217-223 | sdk/rust/lib/backend/local/sandbox/mod.rs:220-226 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"373eee259edc5e53c7261bb813740cce00da223df051856e18fbaa01d4d3a4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/backend/local/sandbox/create.rs:1855-1862 | sdk/rust/lib/backend/local/sandbox/create.rs:1893-1899 \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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02acafd15febf6d315ab2a7915de66262bf3b69c0d47a18daa65401ba9805a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/rust/lib/sandbox/metrics.rs:160-166 | sdk/rust/lib/sandbox/metrics.rs:335-341 \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":"sdk/rust/lib/sandbox/metrics.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd8efce4e501485eff491ac0cb5e2361a0fd3a0ede11544475760c5f449882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:572-576 | sdk/rust/lib/sandbox/ssh.rs:838-842 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2fe2f2f4717077621c1187623b58a22ff874b4727140bb51f21372bbdebf2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sdk/rust/lib/sandbox/attach.rs:156-161 | sdk/rust/lib/sandbox/exec/session.rs:228-233 \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 \u0060sdk/rust/lib/sandbox/attach.rs:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e322a700ea657a9f0c7607d277cb3894e28e9d9f8b445587cda18767887cca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/rust/lib/sandbox/fs.rs:957-965 | sdk/rust/lib/sandbox/fs.rs:1047-1055 \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 \u0060sdk/rust/lib/sandbox/fs.rs:957\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/lib/sandbox/fs.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f7b115dfc5538fd46da9bc496e1430d4fcd58e53caf4b63f7284cb21410e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): examples/python/root-bind/main.py:23-37 | examples/python/root-block/main.py:23-37 | examples/python/root-oci/main.py:18-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/python/root-bind/main.py:23\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":"examples/python/root-bind/main.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf77f689400972d53e6fe4f15c3bc0e12a9ee40720b70348ce0370d7ef2f8180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/smoke/cli/nested-snapshot.py:99-111 | scripts/smoke/cli/nested-snapshot.py:115-127 \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":"scripts/smoke/cli/nested-snapshot.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d92631ec591f17e3a0d530394b789c71006ef267ad62552aad61e70304a0f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201312 lines \u00D7 3): examples/python/net-policy/main.py:15-26 | examples/python/net-policy/main.py:28-39 | examples/python/net-policy/main.py:40-45 \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 \u0060examples/python/net-policy/main.py:15\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 before the matched lines, \u0060examples/python/net-policy/main.py:27\u0060 calls \u0060allow_all\u0060 and \u0060examples/python/net-policy/main.py:14\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":"examples/python/net-policy/main.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3fd3a135e525616b48b367b0838833271b3222cd61e89bc2530104a9519ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/smoke/cli/legacy_storage_preview.py:264-275 | scripts/smoke/cli/legacy_storage_repair.py:289-300 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd88321d055bd1c7e3137756b1123d20ab8edba83810787a5cd2806f3671983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/smoke/cli/checkpoint-integration.py:64-71 | scripts/smoke/cli/managed-job-integration.py:78-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/checkpoint-integration.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f49fc826819ac8b4f674b789d7af5716051c694b74bd613bca15b5ba8c5067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): scripts/smoke/cli/bounded-root-grow.py:30-35 | scripts/smoke/cli/checkpoint-managed-volumes.py:32-38 | scripts/smoke/cli/checkpoint-memory-growth.py:32-37 \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 \u0060scripts/smoke/cli/bounded-root-grow.py:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"scripts/smoke/cli/bounded-root-grow.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4ff0983b11da1061a623cb7626f3f65ea00f399512ac7b6d69cd91b83f6bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/smoke/cli/legacy_storage_coexistence.py:43-48 | scripts/smoke/cli/legacy_storage_coexistence.py:100-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/legacy_storage_coexistence.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"275059a8d274f336006ae6cc6aba2bba25426bcd62919727071f7370812a13db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): scripts/smoke/cli/legacy_storage_preview.py:272-276 | scripts/smoke/cli/legacy_storage_repair.py:297-301 | scripts/smoke/cli/legacy_storage_repair.py:303-307 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"854d9efb72512f7b387215f1dd89e79e4d4d06220a740388ca9bfa2e60bb5688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/windows_runner_controller/controller.py:74-78 | scripts/ci/windows_runner_controller/controller.py:82-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/windows_runner_controller/controller.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34b968f937950785b1695a3ee3ee50e3a24891ec0f02548037556b731772c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/smoke/cli/cow-memory-lifecycle.py:43-48 | scripts/smoke/cli/direct-branch.py:27-32 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke/cli/cow-memory-lifecycle.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3351d9b7cbfddeb4b2b645d7695518df2e4f4179dab32a7c94e6bbf5b810b9a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/smoke/cli/legacy_storage_migration.py:706-710 | scripts/smoke/cli/legacy_storage_migration.py:725-729 \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":"scripts/smoke/cli/legacy_storage_migration.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c0f7e6d3e6d3c239f7f2e094dd0502a0f4e3f6716aafccc8b09221f846d365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/publish-crates.py:148-152 | scripts/smoke/cli/root-disk-growth.py:63-67 \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":"scripts/ci/publish-crates.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a834ab82c8d4b1cc578ad5bb2a8c1eeb46d61cc4476bf6a7bd2e47cca2f7cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk/go/examples/filesystem/main.go:34-44 | sdk/go/examples/streaming/main.go:31-41 \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 \u0060sdk/go/examples/filesystem/main.go:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also 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":"sdk/go/examples/filesystem/main.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d313a7f553977e42c16c19b0b8499c79e041f1c8cac5cc8cd0d8ae6106b9bcdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): sdk/go/examples/patches/main.go:70-79 | sdk/go/examples/ports/main.go:43-51 | sdk/go/examples/secrets/main.go:49-57 | sdk/go/examples/tls/main.go:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/examples/patches/main.go:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/examples/patches/main.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5719dc4f6fdff34284fb1ee749eab2d030d72d2ad6cd41b2ce75fa11d2884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sdk/go/examples/errors/main.go:118-127 | sdk/go/examples/metrics/main.go:89-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"sdk/go/examples/errors/main.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"376962d96eaaf11dc44d38c324b2efda99af5917b440a6998ae86682e2d8032a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): sdk/go/examples/filesystem/main.go:37-44 | sdk/go/examples/patches/main.go:71-79 | sdk/go/examples/ports/main.go:43-51 | sdk/go/examples/secrets/main.go:49-57 | sdk/go/examples/streaming/main.go:34-41 | sdk/go/examples/tls/main.go:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/examples/filesystem/main.go:37\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":"sdk/go/examples/filesystem/main.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cb95f4891274981dbad6ad5ab80cd796834c1cf78ac68889df5ed5a88fa664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): sdk/go/examples/network/main.go:116-120 | sdk/go/examples/secrets/main.go:55-59 | sdk/go/examples/tls/main.go:59-66 \u2014 \u0060sdk/go/examples/secrets/main.go\u0060 and \u0060sdk/go/examples/tls/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/examples/network/main.go:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/examples/network/main.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2132aae7296f20211ade618a8344a1ef0f1204f84f5baab47c4b8b2df89f6f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 15): sdk/go/examples/basic/main.go:23-28 | sdk/go/examples/detached/main.go:28-33 | sdk/go/examples/disk/main.go:31-36 | sdk/go/examples/errors/main.go:27-32 | sdk/go/examples/filesystem/main.go:26-31 | sdk/go/examples/image-cache/main.go:31-36 | sdk/go/examples/metrics/main.go:27-32 | sdk/go/examples/network/main.go:30-35 | sdk/go/examples/patches/main.go:25-30 | sdk/go/examples/ports/main.go:30-35 | sdk/go/examples/secrets/main.go:29-34 | sdk/go/examples/snapshot-fork/main.go:24-29 | sdk/go/examples/streaming/main.go:23-28 | sdk/go/examples/tls/main.go:30-35 | sdk/go/examples/volumes/main.go:21-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 15 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 15 times. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/examples/basic/main.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"527d84b41e698504dc074f36129b61e0e7805bd988ab60a0e7412c8af6c9c150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): sdk/go/examples/filesystem/main.go:40-45 | sdk/go/examples/network/main.go:114-119 | sdk/go/examples/patches/main.go:75-80 | sdk/go/examples/ports/main.go:47-52 | sdk/go/examples/secrets/main.go:53-58 | sdk/go/examples/snapshot-fork/main.go:90-95 | sdk/go/examples/streaming/main.go:37-42 | sdk/go/examples/tls/main.go:57-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/examples/filesystem/main.go:40\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":"sdk/go/examples/filesystem/main.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b64299dfbe5c2f1f169927f20da17baa360d5ed437736b422808e16092644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): sdk/go/examples/disk/main.go:139-145 | sdk/go/examples/errors/main.go:129-135 | sdk/go/examples/metrics/main.go:100-106 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also 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":"sdk/go/examples/disk/main.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1be17603e45b357bb82605be910f27043c3a0e1b62e3c63e0cff00e7dc45db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sdk/go/examples/streaming/main.go:110-121 | sdk/go/examples/streaming/main.go:158-169 \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 \u0060sdk/go/examples/streaming/main.go:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sdk/go/examples/streaming/main.go:122\u0060 calls \u0060Printf\u0060 and \u0060sdk/go/examples/streaming/main.go:170\u0060 does not \u2014 after which the two agree again for 3 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":"sdk/go/examples/streaming/main.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a82bd0f436bb1c001b50615a63aed57915918777aa13b0733578be97b461ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/go/examples/lifecycle-convergence/main.go:224-232 | sdk/go/examples/lifecycle-convergence/main.go:308-316 \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 \u0060sdk/go/examples/lifecycle-convergence/main.go:224\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/go/examples/lifecycle-convergence/main.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c66972613e7bca7c12a0d2a0d1ec025be6d4d02b529581402a97fce05d73713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk/go/examples/lifecycle-convergence/main.go:251-259 | sdk/go/examples/lifecycle-convergence/main.go:293-301 \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":"sdk/go/examples/lifecycle-convergence/main.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4c5086ea49708b2c273c2698515e8dc6595e9074b21d8295cb7b76c7dfee47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/go/examples/detached/main.go:92-99 | sdk/go/examples/snapshot-fork/main.go:87-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/go/examples/detached/main.go:92\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":"sdk/go/examples/detached/main.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"07935344d0fb3df0da6c6a6c19b68e01a6e7e6cc2faeb21c9572e753f8ff2d80"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project microsandbox-runtime: microsandbox-runtime has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9eec71b5e345d1f5524d1eeb99affa66cf7e04a5024b59941e0bb8349bf32dc0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @microsandbox/types: @microsandbox/types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9283a5b981737faaeab72147c9043c7f281062a4c19810e3947e2ccb32babe44"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-metrics: microsandbox-metrics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"301deadcaf3ffb5f41e3b4d73f87fc103f539a3804c7c9876fa1264fc8e83f3b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-vsock: microsandbox-vsock: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e458884659453d09eed991a2716f799a7954d56e063c3c435d135eed828252b2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-utils: microsandbox-utils: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"111f9cd587fa544534ce846caae81f7a2d3a5ebe55461be0c2acd1ba05a9f07c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-protocol: microsandbox-protocol: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ea0fd5be411e16bd61f7f03db07396ed157b682b4bbdb1007a21ef322e15d06"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-types: microsandbox-types: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cb397425d5edfb5b6507fa3ce1e69795d399517edbbb3794b30f8f01b454b3c0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @microsandbox/protocol-client: @microsandbox/protocol-client: abstractness 0.16, instability 0.00, distance 0.84 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a618f0c9f8a7aea72562b57ec41ee2230c5a77017752794f1cc99d7a0255037"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: microsandbox-filesystem: microsandbox-filesystem: abstractness 0.03, instability 0.25, distance 0.72 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ebd972e28209900e3d2d7bd8f6a2c35ebc3b426ecdf62bc36db259eb6f4c9e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LocalBackend (LCOM4 36): LocalBackend\u0027s methods fall into 36 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 36 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":"sdk/rust/lib/backend/local/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"96289ea87b4da2887c80d17ec9c885527a817bf49d957cd5cd6430087ec70584"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CloudBackend (LCOM4 30): CloudBackend\u0027s methods fall into 30 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 30 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":"sdk/rust/lib/backend/cloud/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdc20a8de04496238394e5ea46a83a3ba9f8aacd7debb8bb1b3bf5d7ff4f03a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentBootstrapFs (LCOM4 8): AgentBootstrapFs\u0027s methods fall into 8 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 8 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":"crates/runtime/lib/runner/bootstrap_fs.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eed50cd885561e51587080f7e279ca133b7b9b212fd25024b521fbe385e0ec7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SharedState (LCOM4 5): SharedState\u0027s methods fall into 5 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 5 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":"crates/network/lib/engine/netstack/shared.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"45004fff48ddf002f66162de06589c511b76097907b67f85a8adb10886c33c02"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WakePipe (LCOM4 5): WakePipe\u0027s methods fall into 5 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 5 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":"crates/utils/lib/wake_pipe.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aac6c658b2f2dc145caef0f3ca797a2d08e93e583cee489a37b8cf5bb30f87"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsHttpBuilder (LCOM4 5): JsHttpBuilder\u0027s methods fall into 5 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 5 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":"sdk/node-ts/native/http_builder.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"184d76f2238597271624d9dee4639ad3c6f12614071972c7a155923ed4233749"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SingleFileFs (LCOM4 4): SingleFileFs\u0027s methods fall into 4 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 4 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":"crates/filesystem/lib/backends/singlefilefs/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb61122ed9cb7e05a6868f990451e0bb762b4056a341cbf9d65858da64f74ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GlobalConfig (LCOM4 4): GlobalConfig\u0027s methods fall into 4 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 4 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":"sdk/rust/lib/config/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2c5ffddcb069543a9518a4785de5340c18e6cf90af26f4b01cf850d1604fb7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SshStdioStream (LCOM4 4): SshStdioStream\u0027s methods fall into 4 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 4 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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4770625d347ee95615e398c857862a9c7251dc28a27a73ba47306a15ef2e5a"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 packages/agent-client/typescript/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: can be used directly as input to NetworkBuilder.policy(): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/tests/unit/policy.test.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"698d67d15b1b719ee61ae39abdff518068a1278a443a948dca76384b6572777f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: cleanup accepts an already removed sandbox: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/scripts/cloud-release-smoke.test.mts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f78cfd2c83376e1f7724f0f3d889b1e820975bb66941d830d64c89f99b4e917"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: waits for the browser write queue and wakes writes and reads on close: This test starts work it did not wait for (\u0060write\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 10))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/tests/websocket.test.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0574c28f0e7364629c2a0cd0e80270d8f685eb1e6715ed9607be5df89e09b70f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: builds a snapshot archive copy with replacement metadata: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/tests/unit/snapshot.test.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c563b05e40bfd23721fc0d5c167f0376e84f72d4857b5d8e89ef344db43fe5"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite cannot be installed from its own lockfile: sdk/node-ts/: The vitest suite in sdk/node-ts/ was never exercised because its dependency install refused the committed lockfile \u2014 the dependency install for sdk/node-ts/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"21b0e12038cdd8ce0a1800cf4271554ef3d0adb0cefb094d9bb0e689ccac876f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/sandbox/create.rs: sdk/rust/lib/backend/local/sandbox/create.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in LocalBackend::create_sandbox at line 122. 22 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/sandbox/create.rs\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":"sdk/rust/lib/backend/local/sandbox/create.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b4805164a609b1a240080520d79e2e58e2d2f012300efb9f78c08ba7d9d8e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/python/src/helpers.rs: sdk/python/src/helpers.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in microsandbox_py::helpers::sandbox_builder_from_args at line 402. 8 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/python/src/helpers.rs\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":"sdk/python/src/helpers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0566abc689cdbd5d0eb3920da57d7e329e5574af1bee6d5be8fbe2fe2570890"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/go/native/src/lib.rs: sdk/go/native/src/lib.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in microsandbox_go::msb_sandbox_create at line 2479. 8 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/go/native/src/lib.rs\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":"sdk/go/native/src/lib.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1056504af9b574ee91fe036cd842cd1bb827a7fbe2a71f46547c24bfd69b6107"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/runner/vm.rs: crates/runtime/lib/runner/vm.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in microsandbox_runtime::lib::runner::vm::build_vm at line 1934. 7 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/runner/vm.rs\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":"crates/runtime/lib/runner/vm.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"1533c3bcce7cd29c6ce7217a38c22ce7b67c473a798e13cd117066467a9b36ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/runner/relay.rs: crates/runtime/lib/runner/relay.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 119 in microsandbox_runtime::lib::runner::relay::client_reader_task at line 4582. 10 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/runner/relay.rs\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":"crates/runtime/lib/runner/relay.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be3773cb47e34741e3fb56233cc8eab940afde54073553d08b08ad7199f1658"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/runtime/spawn.rs: sdk/rust/lib/runtime/spawn.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in LocalBackend::launch_sandbox at line 291. 14 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/runtime/spawn.rs\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":"sdk/rust/lib/runtime/spawn.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2929cf402896c99d1f0d107d6778781f7faa933e04d5eb722699c5f2ebaa74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/common.rs: crates/cli/lib/commands/common.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in microsandbox_cli::lib::commands::common::apply_sandbox_opts_inner at line 1384. 5 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/common.rs\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":"crates/cli/lib/commands/common.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5d1a684eb4524a05cdf4382c65e578dac0f4a49a3f2b7c706eaaf818f94b90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agentd/lib/agent.rs: crates/agentd/lib/agent.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in microsandbox_agentd::lib::agent::handle_message_with_charge at line 2521. 6 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/lib/agent.rs\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":"crates/agentd/lib/agent.rs"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c79880bbddf342ce37f7cb3ab21d6883b17d8cada034cbc0cb16a507642808"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/python/microsandbox/types.py: sdk/python/microsandbox/types.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in MountConfig._to_dict at line 703. 5 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/python/microsandbox/types.py\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":"sdk/python/microsandbox/types.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91c9eb96d8a5afa68535d7c5b99f836bdbad1223f0d23df8ef4528ee3d1132a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/builder.rs: sdk/rust/lib/sandbox/builder.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in SandboxBuilder::validate at line 1851. 12 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/builder.rs\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":"sdk/rust/lib/sandbox/builder.rs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22070b3b765afd33601552ea3f50d4c0bb5ae902c9512716384c2083c6b0fbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/ruby/ext/microsandbox/src/lib.rs: sdk/ruby/ext/microsandbox/src/lib.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in microsandbox_ruby::apply_builder_options at line 773. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/ruby/ext/microsandbox/src/lib.rs\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":"sdk/ruby/ext/microsandbox/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f3c68d45cd82b77ac698331582d62294adb3abc51b865ecfa96fa3bf9c7a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/bin/main.rs: crates/cli/bin/main.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in microsandbox_cli::bin::run_async_command_anyhow at line 659. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/bin/main.rs\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":"crates/cli/bin/main.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b9ca91de0828fc3f503e66992c863381ca44cbd12a0daa1c7df53682598be3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/cloud/sandbox.rs: sdk/rust/lib/backend/cloud/sandbox.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in microsandbox::lib::backend::cloud::sandbox::reject_dropped_cloud_create_fields at line 577. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/cloud/sandbox.rs\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":"sdk/rust/lib/backend/cloud/sandbox.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5424d6018d5b2f71e9e626df0d7a50e5fdd0a2311d08b769e8cd0643d618c582"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/tcp/proxy.rs: crates/network/lib/engine/tcp/proxy.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in TcpProxy::try_run at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/tcp/proxy.rs\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":"crates/network/lib/engine/tcp/proxy.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce7f64e50e457ffefede769ae901eb5bb6ab35afa6dbab4b7d75a845d7e1046"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/netstack/poll.rs: crates/network/lib/engine/netstack/poll.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in microsandbox_network::lib::engine::netstack::poll::smoltcp_poll_loop at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/netstack/poll.rs\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":"crates/network/lib/engine/netstack/poll.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3182a1d352616fcb64fe482adbc1951ac56863c7e20651f05c38c12852bca5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/runtime/launch_contract.rs: sdk/rust/lib/runtime/launch_contract.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in LaunchContract::to_previous_version at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/runtime/launch_contract.rs\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":"sdk/rust/lib/runtime/launch_contract.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"209cd407c9483629bb52bbc8e82187fa81db4d60317c96dde73858c0f6e993f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/sandbox_config.rs: crates/cli/lib/sandbox_config.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in microsandbox_cli::lib::sandbox_config::materialize_network_patch at line 1609. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/sandbox_config.rs\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":"crates/cli/lib/sandbox_config.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeef1260de96c67e4dcc46e261f13ea6c75fcb703d7f7f96de40ae21b609034"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/snapshot/archive.rs: sdk/rust/lib/backend/local/snapshot/archive.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in microsandbox::lib::backend::local::snapshot::archive::validate_released_archive_inventory at line 3384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/archive.rs\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":"sdk/rust/lib/backend/local/snapshot/archive.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a11b7544863b650025e7b6299b99a7079be14ee0496be3f607f0dde44ca8f9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/go/sandbox.go: sdk/go/sandbox.go changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in microsandbox.buildFFICreateOptions at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/go/sandbox.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":"sdk/go/sandbox.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"01266b3188dff83f5d7620ddd3411b6a01a006f0ebf36be40bdb921de420e9fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/self_cmd.rs: crates/cli/lib/commands/self_cmd.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in microsandbox_cli::lib::commands::self_cmd::run_downgrade_with_db at line 1087. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/self_cmd.rs\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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c644204f4686baa12a2de4bfaffbe4833a0598660187048342bb41729a07f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/sandbox/mod.rs: sdk/rust/lib/backend/local/sandbox/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LocalBackend::reconcile_sandbox_runtime_state_owned at line 751. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/sandbox/mod.rs\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":"sdk/rust/lib/backend/local/sandbox/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47ba35a37a9ce8875b180a28db7b9d935ed3ae70c2850df5962a9999cb40a55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/secrets/handler.rs: crates/network/lib/engine/secrets/handler.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in SecretsHandler::substitute_ready at line 958. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/secrets/handler.rs\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":"crates/network/lib/engine/secrets/handler.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a532e8a844f4c9ca27b1f8df4e391accf688e1dd4dbb82bb0ddb5985c9b73c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/checkpoint/coordinator.rs: crates/runtime/lib/checkpoint/coordinator.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in CheckpointCoordinator::capture_paused at line 1362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/checkpoint/coordinator.rs\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":"crates/runtime/lib/checkpoint/coordinator.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e53fadf0be7103cbc2fc990426ca3585c9baebad0e23ecc24b7f4cec113c74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/network.rs: crates/network/lib/engine/network.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SmoltcpNetwork::build at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/network.rs\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":"crates/network/lib/engine/network.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa3096068ef3c0fb883acceb54e7ca6654df090a20ceee66f469cafc094afd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/types.rs: sdk/rust/lib/sandbox/types.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in MountBuilder::build at line 532. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/types.rs\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":"sdk/rust/lib/sandbox/types.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3889816a12aad378955823c85da85ef23faba6159cd2cfe3e23b2feea64a9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/machine_cmd.rs: crates/cli/lib/machine_cmd.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in microsandbox_cli::lib::machine_cmd::run at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/machine_cmd.rs\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":"crates/cli/lib/machine_cmd.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"380f1b17bdb0591e0e0f925ed425e46d997f493596566fe15d82770a653c8a3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/client/launch.rs: crates/runtime/lib/client/launch.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LaunchConfig::decode at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/client/launch.rs\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":"crates/runtime/lib/client/launch.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"968da85f26487ecedd1c3f942524437f67505393f50a8e622ddc3f04f33e2848"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/python/src/sandbox.rs: sdk/python/src/sandbox.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in microsandbox_py::sandbox::build_secret_patches at line 1609. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/python/src/sandbox.rs\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":"sdk/python/src/sandbox.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"362e00b71f0ff8109369a7e7d7a2391d7989102359b47740157cd9fd8945416f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/run.rs: crates/cli/lib/commands/run.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in microsandbox_cli::lib::commands::run::run_new at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/run.rs\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":"crates/cli/lib/commands/run.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f2d48171a900093b685af95575d2e3c5d9f8fd3e66ea6b2dd7d71278b16a66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agentd/lib/session.rs: crates/agentd/lib/session.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ExecSession::spawn_pty at line 1003. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/lib/session.rs\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":"crates/agentd/lib/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8aad5da8dddda8baebd967d4430c24f1155469d588d2eda688056a9a8e6ed2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/python/src/error.rs: sdk/python/src/error.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in microsandbox_py::error::to_py_err at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/python/src/error.rs\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":"sdk/python/src/error.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1575c8b6df6c6e59d3dc3dfa22ab5d429ba405c9d8de69aec7ddb921a4845200"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/ssh.rs: sdk/rust/lib/sandbox/ssh.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SshClient::attach_with at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/ssh.rs\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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b8bdd0afc7499343b72a3069b75863516460cb1bfdbe0616474d0c6b6d4212"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/branch.rs: sdk/rust/lib/sandbox/branch.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in microsandbox::lib::sandbox::branch::prepare_branch at line 359. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/branch.rs\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":"sdk/rust/lib/sandbox/branch.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1c882bdd930e05c5ea1d9f97046ec89b13954463722384434576a4f7f295b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/runner/control/executor.rs: crates/runtime/lib/runner/control/executor.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in RuntimeControlExecutor::execute_locked at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/runner/control/executor.rs\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":"crates/runtime/lib/runner/control/executor.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f66f421887f2ddd69d56c58a79332068221b586e9cc08330000b4a63f3a1db4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/snapshot/store.rs: sdk/rust/lib/backend/local/snapshot/store.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in microsandbox::lib::backend::local::snapshot::store::open_snapshot_impl at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/store.rs\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":"sdk/rust/lib/backend/local/snapshot/store.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e7435ee4358baef6a301b5625ed1d6f6395a8199692d0b1beafd324c49ed1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/patch.rs: sdk/rust/lib/sandbox/patch.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in microsandbox::lib::sandbox::patch::apply_one_to_tree at line 801. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/patch.rs\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":"sdk/rust/lib/sandbox/patch.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c189739123993ec3feb7768e42c97d477eee17ef8f97a3600645d4f324232a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/exec/session.rs: sdk/rust/lib/sandbox/exec/session.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in microsandbox::lib::sandbox::exec::session::agent::event_mapper_task at line 792. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/exec/session.rs\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":"sdk/rust/lib/sandbox/exec/session.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0d11632ac75850ab937ea7c76fe80a21e90d60732ca6dda7f9acdbf908126"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/inspect.rs: crates/cli/lib/commands/inspect.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in microsandbox_cli::lib::commands::inspect::run at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/inspect.rs\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":"crates/cli/lib/commands/inspect.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a891ae794df552128adfd05fcf3005fd48424726d30623ba9b0ebfa74b6341a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/modify.rs: crates/cli/lib/commands/modify.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in microsandbox_cli::lib::commands::modify::replayed_args at line 684. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/modify.rs\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":"crates/cli/lib/commands/modify.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"432e75b9cca2e0fe2f33359b178a60b3e50339569787da0100bd76fef001cd48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/external_mounts.rs: sdk/rust/lib/sandbox/external_mounts.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in microsandbox::lib::sandbox::external_mounts::resolve_external_mounts at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/external_mounts.rs\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":"sdk/rust/lib/sandbox/external_mounts.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b036be6ad3c495b6d313317d2fcbd18eb246c80ba935cd540d12b02973976de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/image/lib/registry/client.rs: crates/image/lib/registry/client.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Registry::materialize_layer_stage at line 901. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/image/lib/registry/client.rs\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":"crates/image/lib/registry/client.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46bc09236a021be70bc99f097e3dcd762312bf0d95363354f307819b0cf9c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/ports/publisher.rs: crates/network/lib/engine/ports/publisher.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PortPublisher::relay_data at line 542. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/ports/publisher.rs\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":"crates/network/lib/engine/ports/publisher.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"080c3cd7c93ae87035eede4996ccfea57c4e8c7326383a9c4456de2e854db8cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/tcp/connection.rs: crates/network/lib/engine/tcp/connection.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TcpConnectionTracker::relay_data at line 424. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/tcp/connection.rs\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":"crates/network/lib/engine/tcp/connection.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefd2ac77588d18d7ade156ededa050aba390057d04872302386e2be22d95039"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/go/native/src/restore.rs: sdk/go/native/src/restore.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in microsandbox_go::restore::builder at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/go/native/src/restore.rs\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":"sdk/go/native/src/restore.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"021d63d83d6ecec4d13917b8c2ceb6a6a63cfdf653e9c76fe6d5f7fa17936eb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs: crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in microsandbox_filesystem::lib::backends::passthroughfs::unix::metadata::do_setattr at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs\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":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"406675f0415136171368a3b8e7dabc448fdf04e6a98a0ff06401864d97f82cfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/snapshot/archive/batch.rs: sdk/rust/lib/backend/local/snapshot/archive/batch.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in microsandbox::lib::backend::local::snapshot::archive::batch::load at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/archive/batch.rs\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":"sdk/rust/lib/backend/local/snapshot/archive/batch.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c190a384b44bf77a4bac5a905435dc3b609e0b4fdd798f5df46097cc8b5b3162"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agentd/lib/config.rs: crates/agentd/lib/config.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in microsandbox_agentd::lib::config::validate_guest_bootstrap at line 1319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/lib/config.rs\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":"crates/agentd/lib/config.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"619cbc74eaefd0acaa9f40b9e6942f81680db8d3ce93a7417b334ad708488560"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/lib/commands/exec.rs: crates/cli/lib/commands/exec.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in microsandbox_cli::lib::commands::exec::drive_stream at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/lib/commands/exec.rs\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":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa18d8192f388f20d2533faf70339bab2aff3b6d51f9ad47955062bed62ec02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/runtime/launch_input.rs: sdk/rust/lib/runtime/launch_input.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in microsandbox::lib::runtime::launch_input::legacy_env at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/runtime/launch_input.rs\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":"sdk/rust/lib/runtime/launch_input.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf21e721d305c365409a4068f049691e66cfe6f1637dcd4c137f688e506b2cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/lib/runner/jobs.rs: crates/runtime/lib/runner/jobs.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in JobManager::run at line 745. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/runtime/lib/runner/jobs.rs\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":"crates/runtime/lib/runner/jobs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4901e23d1893cf2db454dba3a70bcf835d7030e9249da5a1d086e2559b5e68c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/sandbox/attach.rs: sdk/rust/lib/sandbox/attach.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in microsandbox::lib::sandbox::attach::agent::attach at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/attach.rs\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":"sdk/rust/lib/sandbox/attach.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd90a66475f16e94c83a9fcffc48a8ead846352e418205ba6921cd074e3bab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/engine/dns/forwarder.rs: crates/network/lib/engine/dns/forwarder.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DnsForwarder::forward_query at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/engine/dns/forwarder.rs\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":"crates/network/lib/engine/dns/forwarder.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e4eb2b7226098bde026d351a2a2d8d053b79ff9e5452e426b6335c897682d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/microsandbox-types/macros/lib/config_patch.rs: packages/microsandbox-types/macros/lib/config_patch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in PatchField::parse at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- packages/microsandbox-types/macros/lib/config_patch.rs\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":"packages/microsandbox-types/macros/lib/config_patch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9554753ab5a1caffcbe6d56b0180a08de6e5a06871edd8683eb00948adb465"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/snapshot/downgrade.rs: sdk/rust/lib/backend/local/snapshot/downgrade.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in microsandbox::lib::backend::local::snapshot::downgrade::load_candidate at line 480. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/downgrade.rs\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":"sdk/rust/lib/backend/local/snapshot/downgrade.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefda1bf71e3d3e438c42e64e9f205bd6c6c7ec97bcac8997123dfbce5dd0c8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agentd/bin/main.rs: crates/agentd/bin/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in microsandbox_agentd::bin::main at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/bin/main.rs\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":"crates/agentd/bin/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a052e1fda5ec15a1eddcb2c5bc6c5de073cd26455c60fde8afe0023a6aa1010a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/metrics/lib/registry.rs: crates/metrics/lib/registry.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MetricsSlotWriter::write_sample at line 852. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/metrics/lib/registry.rs\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":"crates/metrics/lib/registry.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e548e260bced979f1c596ee310ef1513473abc6d199546b96662c92c11e28c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs: crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PassthroughFs::do_setattr at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs\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":"crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"644db471a16258e327aa7bbc566a9784b13180fbcd53a86a428c8a76181fca5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/image/lib/ext4/resizer.rs: crates/image/lib/ext4/resizer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in microsandbox_image::lib::ext4::resizer::parse_and_validate at line 517. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/image/lib/ext4/resizer.rs\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":"crates/image/lib/ext4/resizer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804334e2e9eeb934bcc4f13783cb2dc4ed782699604f4680559e3163b1a553a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agentd/lib/fs.rs: crates/agentd/lib/fs.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in microsandbox_agentd::lib::fs::handle_fs_request at line 327. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/lib/fs.rs\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":"crates/agentd/lib/fs.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bbcf3e9dd2edb43bb5e92e341c1f7d85e448dc5b3b670d85caf0e8268c3382"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/metrics-collector/lib/exporters/otel.rs: crates/metrics-collector/lib/exporters/otel.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in microsandbox_metrics_collector::lib::exporters::otel::register_sandbox_instruments at line 618. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/metrics-collector/lib/exporters/otel.rs\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":"crates/metrics-collector/lib/exporters/otel.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"103fd7d0aa32c4dfe29c57384e2b75bc79131b1dcddbd2eea4eeb50c18e14608"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/network/lib/proxy/socks.rs: crates/network/lib/proxy/socks.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ResolvedOutboundProxy::build at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/network/lib/proxy/socks.rs\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":"crates/network/lib/proxy/socks.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc277e3eb12fd85fdcf5c39cbd3ac59d603578659ea52882c5d8fb83a893d886"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/rust/lib/backend/local/snapshot/deletion.rs: sdk/rust/lib/backend/local/snapshot/deletion.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in microsandbox::lib::backend::local::snapshot::deletion::recover_parent at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/deletion.rs\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":"sdk/rust/lib/backend/local/snapshot/deletion.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06cc8d1e5eace4c3f8ec59b29f501587c94628999cec3c01cf1ec8a0ecc7f8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/sync-docs-openapi.py: scripts/sync-docs-openapi.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sync-docs-openapi.curate at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- scripts/sync-docs-openapi.py\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":"scripts/sync-docs-openapi.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac3a4105abb4c67f1f6695ecb5a261399198f6ce52b8bbce64f4c97830b1e1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs: crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in microsandbox_filesystem::lib::backends::passthroughfs::unix::create_ops::do_create at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs\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":"crates/filesystem/lib/backends/passthroughfs/unix/create_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843ef35356e2eecf219418f38d2a053a49b5e7f4a9f9d3b5e43fd252fda6d51"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/sandbox/create/cleanup.rs: sdk/rust/lib/backend/local/sandbox/create/cleanup.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is CleanupState::cleanup at line 92), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(config): preserve caller overrides across rebuilds (#1913)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/sandbox/create/cleanup.rs\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":"sdk/rust/lib/backend/local/sandbox/create/cleanup.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d2df9918b055ef71202ddf71ce2e76e7a79b39d9913f72f06f6c4b91246614"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/database.rs: sdk/rust/lib/backend/local/database.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is LocalBackend::read_current_catalog at line 49), 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(release): enable keyring in cli builds (#1976)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/database.rs\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":"sdk/rust/lib/backend/local/database.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c893d4122dc47d3448d5bb0e21ba5a4daad3ffaa3bfba44636775865e95bc120"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/migration/lib/schema_metadata.rs: crates/migration/lib/schema_metadata.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is microsandbox_migration::lib::schema_metadata::canonical_applied_prefix at line 380), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(config): preserve caller overrides across rebuilds (#1913)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/migration/lib/schema_metadata.rs\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":"crates/migration/lib/schema_metadata.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe4aa55a63a86680a76918580e5f2b163dff6550b3f2caca2c02cd2e9b8f09f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/migration/lib/lib.rs: crates/migration/lib/lib.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is Migrator::migrations at line 59), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(config): preserve caller overrides across rebuilds (#1913)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/migration/lib/lib.rs\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":"crates/migration/lib/lib.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f9bfdca23e19814f94be6616ddd2bff57f7a23a3981bd6163c5a1ccb272a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/volume/mod.rs: sdk/rust/lib/volume/mod.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is microsandbox::lib::volume::create_local at line 581), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(volume): retain local record until file removal succeeds (#1873)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/volume/mod.rs\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":"sdk/rust/lib/volume/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd6e1b6a8fc2202debb01d7fe4211c836a923f23f619d0f7d686fa52b619ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/control_lookup.rs: sdk/rust/lib/backend/local/control_lookup.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is LocalBackend::try_control_target at line 76), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(storage): repair cleanup and snapshot recovery (#1790)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/control_lookup.rs\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":"sdk/rust/lib/backend/local/control_lookup.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17497b6d4c1d95bd5783e94d223a533208c03c3513401a91311acbb765715b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/runtime/mod.rs: sdk/rust/lib/runtime/mod.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is microsandbox::lib::runtime::agent_socket_path at line 47), 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(storage): recover legacy sandbox storage safely (#2022)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Cfix(catalog): separate CLI upgrades from SDK compatibility (#1589)\u201D; \u201Cfix(runtime): recycle network slots (#1391)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/runtime/mod.rs\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":"sdk/rust/lib/runtime/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"110a13d5dd0766b92ae3da1fe32c0cf3701d8813956fa47add4e1cc5150a6527"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs: sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is microsandbox::lib::backend::local::snapshot::restore::additional_disks::materialize_additional_disks at line 16), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\u201D; \u201Cfix(config): preserve caller overrides across rebuilds (#1913)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs\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":"sdk/rust/lib/backend/local/snapshot/restore/additional_disks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d1079051f6990e5cd968c3627c3f83f37dc3ba9a322c4e9e5a411e3a9e697d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/sandbox/compact.rs: sdk/rust/lib/sandbox/compact.rs changed 5 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 5 (its worst body is DiskCompactionBuilder::execute at line 93), 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(storage): recover legacy sandbox storage safely (#2022)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Cfix(config): preserve caller overrides across rebuilds (#1913)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/compact.rs\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":"sdk/rust/lib/sandbox/compact.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd7d7a3e3c7ca3b3376e5a6dd10345c182d9f9553da612888e72813bf6e6c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/snapshot/restore/owned.rs: sdk/rust/lib/backend/local/snapshot/restore/owned.rs changed 5 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 microsandbox::lib::backend::local::snapshot::restore::owned::materialize_owned_volumes at line 18), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/restore/owned.rs\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":"sdk/rust/lib/backend/local/snapshot/restore/owned.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c345a8d0157715af7ee5577fcf826833d6921b67a91f6b33dce2a6e97f5e29de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/backend/local/snapshot/restore.rs: sdk/rust/lib/backend/local/snapshot/restore.rs changed 5 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 14 (its worst body is microsandbox::lib::backend::local::snapshot::restore::adopt_local_branch_for_child at line 212), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/backend/local/snapshot/restore.rs\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":"sdk/rust/lib/backend/local/snapshot/restore.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f46759cb7bab2842605710109714883abf4f05b9ff0a2facac3e6d2d542b6dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/protocol/lib/message.rs: crates/protocol/lib/message.rs changed 5 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 MessageType::min_protocol_version at line 393), 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(exec): bound command buffers without stalling shared transport (#1839)\u201D; \u201Crevert(exec): remove unreleased output backpressure (#1875)\u201D; \u201Cfix(runtime): move guest bootstrap off kernel command line (#1375)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/protocol/lib/message.rs\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":"crates/protocol/lib/message.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"787ab687247c74c6692f8ee45acdfb1297906d746f87f2e58389c530113b5509"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/node-ts/native/restore_builder.rs: sdk/node-ts/native/restore_builder.rs changed 5 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 6 (its worst body is JsRestoreBuilder::log_level at line 236), 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(network): release completed published TCP connections (#1815)\u201D; \u201Cfix(sdk): prevent secret leaks and correct adapter behavior (#1756)\u201D; \u201Cfix(catalog): separate CLI upgrades from SDK compatibility (#1589)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/node-ts/native/restore_builder.rs\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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0aa8a4e49597e75f320bc83775668a9fc3cd67d9abcc095611a8f3401d240d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/sandbox/flat_rootfs.rs: sdk/rust/lib/sandbox/flat_rootfs.rs changed 4 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 8 (its worst body is microsandbox::lib::sandbox::flat_rootfs::create_private_flat_rootfs_sync at line 162), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/flat_rootfs.rs\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":"sdk/rust/lib/sandbox/flat_rootfs.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"448a8c3657a40a1bec03c04b548b3c6b72e503d1e8d34dc4730ddc498a9997c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/sandbox/restore_resources.rs: sdk/rust/lib/sandbox/restore_resources.rs changed 4 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 6 (its worst body is RestoreResources::validate_settings at line 86), 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(snapshot): inspect archive metadata before deferred extraction (#1903)\u201D; \u201Cfix(exec): bound command buffers without stalling shared transport (#1839)\u201D; \u201Cfix(catalog): separate CLI upgrades from SDK compatibility (#1589)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/sandbox/restore_resources.rs\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":"sdk/rust/lib/sandbox/restore_resources.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18f1c935bd26abcc1b6a08e9693a020d3085c5c2f334fc64ac59570bddcea7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/agentd/lib/init.rs: crates/agentd/lib/init.rs changed 4 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 13 (its worst body is microsandbox_agentd::lib::init::linux::mount_file at line 713), 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(agentd): create standard stream symlinks during initialization (#1560)\u201D; \u201Cfix(runtime): move guest bootstrap off kernel command line (#1375)\u201D; \u201Cfix(mounts): order nested destinations parent first (#1376)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/agentd/lib/init.rs\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":"crates/agentd/lib/init.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9029c4ced4b6a7a950807f6b38679ccb2bac391e4d6e8cd5582e187204dcb6ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/filesystem/lib/backends/passthroughfs/unix/special.rs: crates/filesystem/lib/backends/passthroughfs/unix/special.rs 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 11 (its worst body is microsandbox_filesystem::lib::backends::passthroughfs::unix::special::do_fallocate at line 89), 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(filesystem): translate guest sparse seek modes on macos (#1831)\u201D; \u201Cfix(filesystem): keep surviving macos hard links writable (#1668)\u201D; \u201Cfix(filesystem): stop macOS fallocate from truncating larger files (#1575)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/filesystem/lib/backends/passthroughfs/unix/special.rs\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":"crates/filesystem/lib/backends/passthroughfs/unix/special.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c6e0445d34cb4fc21c7ea349d968738872fb86160c8ac1f420d39778d7b819"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/runtime/owned_volumes.rs: sdk/rust/lib/runtime/owned_volumes.rs 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 15 (its worst body is microsandbox::lib::runtime::owned_volumes::try_acquire_disk_guards at line 218), 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(sandbox): recover interrupted creation cleanup (#1929)\u201D; \u201Crevert: rework interrupted creation cleanup (#1928)\u201D; \u201Cfix(sandbox): recover interrupted creation cleanup (#1918)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/runtime/owned_volumes.rs\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":"sdk/rust/lib/runtime/owned_volumes.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1badf0834b41a7674944bf596e7bd9676d8fbfc189126aefe1bcb464d7b861"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sdk/rust/lib/image/cleanup_journal.rs: sdk/rust/lib/image/cleanup_journal.rs 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 11 (its worst body is Journal::open_abandoned at line 68), 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(image): keep pruning safe without blocking unrelated work (#1919)\u201D; \u201Cfix(storage): finish Windows cleanup and usage accounting (#1797)\u201D; \u201Cfix(storage): repair cleanup and snapshot recovery (#1790)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- sdk/rust/lib/image/cleanup_journal.rs\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":"sdk/rust/lib/image/cleanup_journal.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544bbf48179026b17cca7b2e221003f26f93b454347ef7acab3f2051d290fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/image/lib/ext4/formatter.rs: crates/image/lib/ext4/formatter.rs 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 14 (its worst body is microsandbox_image::lib::ext4::formatter::build_inode_from_plan at line 1649), 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(sandbox): keep lower directory metadata for patch parents (#1690)\u201D; \u201Cfix(image): support resizing legacy ext4 upper disks (#1421)\u201D; \u201Cfix(cli): remove backend notices and add mod alias (#1423)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 17:57:26 \u002B01:00\u0027 --until=\u00272026-11-12 17:57:26 \u002B01:00\u0027 --full-history --no-merges -- crates/image/lib/ext4/formatter.rs\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":"crates/image/lib/ext4/formatter.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6db5345e3be3e2c1fef9786b1a8e18f88f8ff21f87412e30a2c23b39471299"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 32 significant file(s) lose their only recent owner: crates/image/lib/ext4/resizer.rs, crates/image/lib/tar/ingest.rs, crates/runtime/lib/runner/writeback/admission.rs, crates/utils/lib/copy.rs, crates/network/lib/engine/udp/fragments.rs, crates/cli/lib/tree.rs, crates/runtime/lib/runner/cpu/planner.rs, crates/runtime/lib/runner/cpu/allocation.rs (\u002B24 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f2ad00592e61a55038ddb87798384d1b0709a1e693250c1d57ee11cd86d8784e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 19 significant file(s) lose their only recent owner: packages/microsandbox-types/rust/lib/cloud/tests.rs, packages/microsandbox-types/macros/lib/config_patch.rs, sdk/rust/lib/runtime/owned_volumes.rs, packages/microsandbox-types/rust/lib/cloud/specs.rs, scripts/sync-docs-openapi.py, crates/cli/lib/commands/storage.rs, sdk/rust/lib/image/cleanup_journal.rs, sdk/rust/lib/backend/cloud/agent.rs (\u002B11 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"112060cb7e8071850ed016b000bff1d7b5cb512107c85581c46c9f503ce0d65e"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 8 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 (64 single-owned of 779 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; 779 of the 1027 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) (\u002B2 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/runtime/lib/runner/console.rs, crates/runtime/lib/runner/relay/input_stall.rs, crates/network/lib/engine/secrets/hpack.rs, scripts/smoke/cli/hpack-secret-guard.py, crates/cli/lib/commands/copy/host_windows.rs, crates/cli/lib/commands/copy/host.rs, sdk/ruby/lib/microsandbox/errors.rb, crates/cli/lib/commands/completion.rs (\u002B4 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(upgrade-0.6): Remove in 0.6.x or later once live-sandbox \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":"sdk/rust/lib/sandbox/ssh.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdbb4829d33f19ba3ccc541ffdc8520c09201b1f5b68f8dd556dc59b7d0476a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(upgrade-0.6): Remove in 0.6.x or later once live-sandbox \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2898d9edf991a332a541c4fc40dacc5fd506892bc7ba3c325ed7c266a7e27cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(upgrade-0.6): Remove in 0.6.x or later once live-sandbox \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"517b08fd98cb216eb7e58088a21f898face07b9c95056354ec5dfb36c963d458"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(upgrade-0.6): Remove in 0.6.x or later once live-sandbox \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":"crates/cli/lib/commands/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"19989e0d6e7066d88ce7ec59b3a9dc9005ec3461732953773d58d0b51fc152e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: surface follow_root_symlinks in the Node opt-out API. \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":"sdk/node-ts/native/mount_builder.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5d935e02405d1723b23a0c92e77e8f188f4a692c293c85bbb61ec4c59ca3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when stop-flush ensures guest writes are persisted into the \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":"sdk/go/integration/snapshot_test.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e9e0e9674e246902f2bf8766751ac3bdfa55c2f910cf1d94c0c2bfd3f7866"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(upgrade-0.6): Remove in 0.6.x or later once live-sandbox \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a822591fb54c54597512230babb267d7fa4560ecbd51eb7f10045097b574089c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(upgrade-0.6): Remove in 0.6.x or later once pre-0.5 relay \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":"packages/agent-client/rust/lib/optimized.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5672054af1bf44bf673b21824f2724fa2bb82176df31923d426930414b047a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(upgrade-0.6): Remove in 0.6.x or later if migration history is \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":"crates/migration/lib/m20260527_000001_migrate_oci_rootfs_source.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05962c95c7a61e13d80df47daa0893d693c799369bfc6eb2256e036cb05e59d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(upgrade): Remove once migration history is squashed and databases \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":"crates/migration/lib/m20260708_000001_migrate_bind_rootfs_source.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3b1bbbbee0611f8609e5ba1d836fd5a579d181ba4ee3b2d85fbdc3751abd76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// re-parses from raw bytes. TODO: pass this through to avoid re-deserialization. \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":"crates/image/lib/registry/manifest.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef875f37bf630f6092cd6a0cf6dbed9acedf495fe4b20cba0275f93d9d07e3"}},{"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 \u0060sdk/rust/Cargo.toml\u0060 makes this repository a deployable product (line 14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/rust/Cargo.toml"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fe7aff42c642b54e8f58eb9367f7886b0268f2d1620004601f66532408cf0c"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32fac9507cad5106c889d1dbf59745cd964c66e3830e6c3923337aa60ba54c21"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"239dfab35c1466bb5fd28dc65496e64d484e5c5bdf2713626ac1e879e6e0a76b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b68cf0f57d2f16587f63f687a302e04a3965b1804ad0a2ada89701292e44213a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8438c384faad1847ac661c0972b0f0ca08777b03e105805a63b327dbaec40331"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34a00fca2ed3a5400474142d68fec7a9b8d16402bf3a44399dcd9e6422ca43ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e88ad7ad0155857deefcf60ad710d63050188e6797ff908905abece25682818"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"080462b0164853d904034a1795058cf4a756069d75960683313157a255851a29"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45163dc101345bfa0365eb60b0f7ca7fc6e2217d6498bc7732f03a2a5a8fb44d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9a5e7793c99fed124e7b65f15b914720abffd42041bb728e082c3ff21cc762b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29f997dde7491b1c3a29d17b47e82ec598c15ff5248cefad55e26734f8dcca7a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2b1d3ec555cbda769249cb2d295c4bc449c5f1fc3d987bb0e9b3de46f5f351b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca914f9dfa9570b549116025d926a549d713c847780c4ada77750956a6cfe6a0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18b05ae5befef71830bea0f5fd43eae4204b5e64f1ead68197ce26d9ba0c5089"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e94ea17eb29f99f36ae9ec6d4cd989bbc11810b0ffa56ee7a52b4477196f3058"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c98d28c58e45076fff98ecf96c8422e3c330abf0fdf2ccbafb441a0730b85e83"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8187a22b758d0bd0bfbc4bbd9527ce2574075b210538ba2116b726938c22f872"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"400a3f22bf2165900abd2456e712abd1648cf4b7a4f5eb87dbf5d1bdf4944cf7"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73449aafe8befd24e9dc4c559592cf58a8211572f2f6eb66005bfe9a383decbd"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4f99fd738fc42e69cd50036ec0763d2d101eefd556553fcd5512a1ea5e65c00"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cfdb8098308a1a5e581a896d9a3fbf6b55f67e12b018b26c3110ef315cb8089"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7612f8efdc8647ca2a77c170b8e982a95c0c3eaa8041632549b374254b24a0be"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86465eb6072e4ab7cdbc2cd7eb961b8dc59ea06bf4c60b72f9ed82baad0cfe66"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88d2cb841d3db248b54885db47998ae6554896d3aa9f662054d17112dcc879eb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f21c0a87f2fa3629153fdb254326383b073e7a4cb77a3963dc71330681ebadb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c5f40f284282adf50ac5ad4c3bc796009c92abd61c9525d485f45b70595c0bb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8d85ef2d28672d784a4ae6f94f7a1b9758cb739f7e069e410c0be2ffd2db73a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4645e05f037c6d7ed9f4635a9f04eb0b1b02d57288d69b73a04111d1e5a1539"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dec36c8c595eefa839002fbd3444066750a3fafeeecf346e5f9d4913598b12e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1290ec50bb2f06e9866f81a779c528c51e40b9286dac4f981ab31f1a96dbcef5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98431999d6239a8888f190de6ae053abf8fb2a703a730f3cf65b2c124ac95613"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b34b0a1f95db37316a0ffabd83ad001072aae9b25e296fc4df787043d46e74b6"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"325c9d2a3317a1ea585fd2d47517efe360f32e0763918aad1fa12808667a7b79"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f590e22e17418da1b342640ca93c5715a02026967e32f7ffe95bf90c83680af"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21c7215c6b5be9198a586f1071f8c7b61a107acf8d742a62f0c2a2eaf60f900e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a4fa81e8ac3174c210934d9364bc19e9d4ca475f9fe5ba889cc27a03850b1cd"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d2d369e2dd4076720ab2e4fe4f5c29b616d3e290d91bc526b88d16497ed222b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a88eee8c2e9d3399cd6e46ba8daa0dab9910919ead96deb64ed5ab6aa3c5a592"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2115cc6830aaff46e60a6eb4dc47e76a6458459fec09e58ef43429cf2a03c63"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de3ce29c31fbb4c0d8d27ddc3c9bf373d796cc077d67b69489c6be0faa32c393"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"337dc2ffddcd193eb785fadf48661b1276f78d854914ed7febea3e79fb7b91b5"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3272ed2a8579571e427a25c2189f3185942f295dd97192be9f0a14ac173e42f"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07c760426c7df630e3d6aa3444f426431aa9466a47d33b89ed0ddfb48faa9cb2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c0eb51572ff789bcd5ce56cdd2cefa8a11478307a17e59b519505b6ffae84b"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5893b6a652600b24400e02ea0378390612a735588a042e8f6ebe283cb895d94e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3282669db6c32af90607d7a6a05bf0863d956dd8f97d9cd63b1b2736866e220"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a310f6ac841f45f0671eaae6599815235b0956f718e8f4f9b454b3cf6066b0e0"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75c04eaedeb92fdb1c007a5b896930470f25bd307f5b568746e1286cc7e7236b"},"taxa":[{"id":"CWE-829","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":"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":"90c212aa2ea37b81ae8b3a825775a7a9cd7898569c141bf7bf3faf5141abda56"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"892b5cc3cdaec5af1f08919952329c85816455c725b2ccd561c2865cfec2d315"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b2cdf7e87fbfeb09656119d4747c0cd6da5b1810a58e286e828f908d1e6a331"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab6ef6c9ad2e476ab26abdc4cda1b7b3b6c648991184d67ed19653ebd8d03112"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"65f642af264e8f224ac9f06ce3bbe95f7641659e281149797a65d3a2c173178a"},"taxa":[{"id":"CWE-829","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":"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":"f342304f2441189899fb362e74c6d03d3eaeeac641fc3b9156730860106e7495"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b3e53d1add2cdc46104fd0b28fc70a48db184382fa41bcbe886ec544a98037b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58d28f0f043009c0f18c710d8a801cdcc7e3a1074a23e5cb2893071b7f135f50"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"065c86590d3d8c349ab114203e7b38a9196214dc588607a912bc6a72b49f9cd8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ec0b8ca843d8ecc0e59f5053c018ae44c16aeb3bf35951d1ddbe84fc122ef11"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f60c7c0e7a2ce96182c81fbca782987653702a5e08386fdaa19b83cd494637b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffe4fc9f2658f18f7f269b82ed508f86604cb33aa11a94ca7a6a58a4d3bf3ced"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e971a157742d733881312e4828fb331d9f1ec298cc8d118c1c8c199050aa06f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7496b53fc206b95ea6db79d1c951a62d1c6d9cb5664a7d29bca9c7755b264b01"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e9df4a787f2fcb7272d427c0358682cfdffc934e7ccee10b2e6c3d11b4ed856"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"793f0903db782932a7b9e454051fb52e657398eb0a9b5fdfdfb679a61f62d55d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bee3c641f1dc7963ab7a219f08342fbf4970904ec65ee8e0fc1a2b1b97a79ad0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43db1428bde33e395bc3c39908f995f66672349acdb41639c8ce3a56ce09065d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6b74f5d4cb65075c40a4529527f57391e595d438b0ded505941d7c40ef41f6e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c557b78672702c2b407e7a1475e268375471ecc282a7b8c0c4ccbfcb32d0bd7a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acf1f3d4fe8b7dd209b7cf1ea0b8301d7dd9ff5f73a2680414615c976a67278d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6849dbc95d8f996035734909e74b8b3462f0f2f2ef7a35d99611e6840ada62cc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4914d0d2dfa01e41f8d8ef0ab5be1d5c8870f57039709bcc1ce59260cc94731"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51efd5a6e5e9d5b7d6770ed90800b87b160236fb1c3446c78ecd113ee0e6fb54"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"804fbd45780511cd8a88345e6a4b41d9bef147de5963af3ace97a5c5806b397c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"004765f5e481701d413a8df1be45eb91f39f34029b0b80f0d63c9c03d9d820f4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13827a1b066beb686e8af30882dd83e4ecb2261b20c2a211a44754125ee83f4f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a28b2f59c2927e169f60a36717856c4daabbaac9966b87efcee58290a994ac9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0605853643edf81366fe91237f46db28f52315e45b7a5c5025336f98aef3d769"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58b03ccce453875da1092b2ddd44dad4243730ddc5dbaf27bae2560466f86340"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5764bbf2cba880447d345d7c0c827ca748b3d808a1bd28a847c4e3a94e4c85a4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d80bb7fca5dc8a765595f4797ddeb4396ddae53e2d80c5048f70b0edbdb6730e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d843534317e0734f690ee49560a1c0375a242615a5508de81110a6165ff7a9f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1077fd41af02e77262554317e10713d792841f9559e89385ecaf2c114bd72b0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47b4fd08f9bdd83a261faa36331fc622180da8dfefa40970f84295b732f5027c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"624d8dbb33f37281bdbb5a9aa62279e64a73b64a0848a4ae9898a9899e687a90"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"427e3f487195bb20f4bc7b6614a4f4c6d36acfc47cd2cf42b278e434535a4b08"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37c84cbc6057e0b975e8d3b96156eba89c8019e5eff3e29a148e8d5a0a134b7d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74a4cb3afce18da43d72e270cfbea0168f7e7eb737c5d4618d0c54f60a532554"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe9004bbdff00e8f59ac3b0342fe21e687b8cabcf28ffc14abdedbaa22ee99ab"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8b7328efaef01d9939c4de51ef65b36261d64f6e5dc44de22bb6364ebbebcce"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49324ac621485c7ab270804a0a508ce6eafa052927c412c724e493ec6a64985c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53ce1375d94eb16ad990c3d80147e7958124ef99afd5ed940359a7d7e3519e7a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbc20e438bdc1cbd452ea025c4edc5e208b1d8b0ea3f171c959981c67d117de9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe1882bcd6d8281afbccecd5520b7cf3b5c211f0315875f2ad582f869d5606b4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d1fea8f92c184c528829453afe9f7e2300b6a3164cc89a08e314d19de4d3233"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72f4ed94b6609be27362d03ca1279b05738a4fd7cca5a19721437b4191a2dd97"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cc9c5f198bc117933eddcc83c5f0da6266474c604475c0dd764471ced1f48be"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbbb32cd7392e675c4c2b31cea22755449b49f875197f94c2a151e66b8236766"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bec92bf7b79503afc07d7a3c099b5f830e1edfa99b6b70d3359884594d8fa3a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd4115ebd022765c7e939a4d7872cd4c654bea3ce564b738ecd7f98a4e9afdd1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa04c22ed91ba8e3fd49ca69b3013d5d8b15051793f202b337e8faf8ba7098d9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89f4e449b2a416e5fae619a52e470a80b63e67de7d42420babf3ac9257ab1ac3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec263938edec76d8c041ba6876cc2f14378460e65aa159c9812fb96d5ccd64e3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6911b78b804babde1228325406b3fab2bc70901dd720c7cc57d6ca4825c3b88b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"601b0db451a165eecb266f9200dcdebe3ff4eaf6cbb1e2561c3d01f531859301"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"545a2cb1d6544ed133049a7e59777ec3ad9bb5fbba3476b67d1493d0be2ca7f8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba7a72aaf8a160e6ebd0268b04d1b698d7e42e3ea9c1e28f806e5c12e4a3faea"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8245d6a1ff6dcd9a0f7126d15af6cf6ba34ab8aa6bc6c519822e4c2ca18ba7bb"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df191fc86e631dc16b27980342285e47eabd9cfa47e17871a7010ee565a68a2b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"311e26a7e434f287fe0ea65dbe31d96b1def07a4b7c1c3c472b7d3cd9d783931"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44b00de1612a9bd5e16feb179f41d2811bb2f20dc5ce01b0c0ef899da30b2435"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78de0535028dc2de5859bcb09997be4f1fde1230c13563f74511c06b70f279ff"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0aba465b8e26362b09b379af35d8068d51cd909f3129c0a009337ad47c28e9bf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fd5d5d2a6172c6e941a3b1b69d5f1108f7430356d9744a5e62be7277ae1a244"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1c6bffd8e40f1e847d3891d89d1ce1223d47064bf67048265bffb242a2fe7d1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"725273ffe34260db840e7667d22c4385db2968e8de7b13069913c6c6c3f0c5ef"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8485429ff56ee28284f66369337d8aa152c475f373958bb73935049bf0257ac"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"377ad83192f295369a1b43824438fe9ab94fe30f683b67a2b60825de3cb3d5a4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32ec0991df99157b87655fc628c54213f03c3cf857a40d2c3a519746f116e9fc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11c62d1615937d8a415efd2b5951cfb321fd5f87c52113bfd50a3097101b2ba8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62cc4e16cb13edd5f251b831711aa1d767a722215ea7f1585d7cbf9b7847d438"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a97ed945132b0f3544982887f88b11cdd5af2a511e8cb273c9580a54a708740"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"963ec435de2c0c03e22b058aeb7c11ae8700649d3dbedda7a3586b4203d29da9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88bb894b3622b481fa1590d8f1458908d97405d97b81530267fbef79e21ec19c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08fed83f9ceb06c20b9ca4f224311f66c4b6f3a8c70b63ac5597370911b61a59"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"984199414eaf484c3ecfbbdffafc01492b70e6c18b0b578ede54d53a8972e972"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f4d9e3a32f1ca8164841b50ad98af5c078596cf536be76a63dc5ef8d5ab87b8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03320c10b834dd93184a5e9e972fe05ec82958f08c13e12ab741038565cac179"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63a3e0b732ced42032546c6d434955fe2cb4a830121b2a82855c3f5e3077bede"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1b86e9bdcde0c8e061171537d59bb8688781eb980f6a47870bf472618e1e39d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10160ef8f92a34ee7ad3b08787571aaad0fdbf671c812c13a7f2a0b3e9d990fc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f75ef05bf39ec969f28cf0c8038a5343f4b275e7a60b151e093f0cc966f4e0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7057084faeb288f738ac030aaca23160be521371f0856b55bc16f843a35d7e73"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33034dd141832bc8933c6b3eb37fbf51b2eb03f57d1f5068ef0692000cbf45b3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2fe807157bb717c77c8bd12d1b03786777343f5433fc1029f2610a2f7a99134"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ceea4da67e207af7ecabb2febc92bb53a51414b5f8d0f269de341b9fb217767a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4283ab29bf71c26b708bac9dab9d4342d2bcb367c5c83ea5ecd1ea824ee18b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb067915706b974b99c54294d552833e3df36da9a1a2469bb34d59e0df9f6c21"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b85cf9094e549d8711e34b7dec5224c20b13857237e7d81c7665502176a2cde"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4648ef21c22a57f780e36e5c1dae240916447bcd8db8a2bf9467b4b6dff24cf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4de15084d62d9314a47c450f9ee8fa6b6373a7559e96b02f6c2fc37eeaf5f2ab"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee31f196cbe2dd59e30c6aa939ec632df6f3a416ad52bcb09d78d97c93883810"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8d827bf15d5f52b854ec4caec40d170f561e72248e1c514cd31edcbc47187ba"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f078c1bf1366984775ff05607ea78f81a4ab3ea8271a18c594207d9bb43b5e2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ea06ab33ace75f5a06b0d8d8a2cd5ad52f398533abf2d547c123779b4237fa8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"679b4b7df88acee6bfff80b437d13046fb9ba3938f66e636d89f545b06759dc2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"301b78d36ce3122f34c3351a168789df1468f367baf133ff7c12aea80c78b7f6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"633e97665f6f54d3efe4e5c981169f7694bc344c3e051230bf45ccdd29084149"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66aebab814871650b7c670f21e82875c7d2e87753cd91074581ade3485ceec07"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3196b7ff713d02382fcc388f8ecacc52a24d0a0c31c3064d4c8a034769f3e786"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32571e49fab9e922f62c93d583e19c16d7c5c4d359eb99377505aa274efaaae6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a54bcc415f3339394f920cf8edd5db0ccbdf089c79b2d601f02ccf5cb3a8cd42"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50a9406ba80c66edb0fd3b32c283a278fc89f3ac99fc46ec3a6138be3c93a8a4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f642a5e501f6f81c68bfd1572e3410cc1203b82784929540e69e046826c76340"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e37d068973a42b03252e227fc9b18e7197c6d97438fdefd892bd6f23bd6a7d5"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5008fe5b71f916faa9104ac0f132a2cfbd0be71cbda47ca7a7d3d6691555820e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a05c1e2fba0da4047f975c82a861492e1e3da103eb093ba0d953412e119d448"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f29b4cb741b9a0550603101dd41e4dc52c8cdd5e00c349f31a7d61d449d0c075"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b87a44e26581b1e4aec5b209a24083da220734a815e30dd319a1ac035913705e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d55681bf08fdfab9caa1b571befeaccc8ebecde845fb3ccbc7100931494df3dc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"125370eb755b8bb1b4d400feafb469010df631b511f62867887a9592ae49e246"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd0ace8196b30a261da4a23e7cfd2926ab38b14536c50895a1a1de505401a76a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"074d654561b40854482b9bb4092cd15f1d6693c503e32e4ab62e7c12a120aafd"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c150e21ca04ff429d932471fca5d331d9f936983628eb29e01a2f9194786dc1f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed189272baf150f3716b5d0a76b8e8fd045142392c22ed9d396fefb6ed521de9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f9a402619b362ee4cff11e815967e22aa40c31491a5bac6cb51b1b12cff00d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c68d784980d6213c42bdf4863ed989b5ddfbd5d1af94e53497df4f9b31e8b22a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d85de29a44b55b42a695e399820b0638f8b0455ce667fcc17f2d46f1d232d48e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd1bd425e3077d5c8e6c262342e17fe826a4d079b435ab39466d07276d79bb8c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bd6d6f2920aa31a21d5b9385f88b997e38903d72fc64c33dfcd4767af87209c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9eff4265798e65e968c6eee140233b88c13aa03c5922d1a31b1ef87101a80575"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed778b56a2a783ebd0c00ebf9281faf9700227d890a72e2119e1cbf44d4bb0a7"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebbfb773e7c6f2f2849f428695cc844fb9732c3e6844dd2118d34265e6a06e74"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66ce75ca2a64d9100a4b9d4869d72dd6f6c35cbc9d35ff23a45806206b18ebce"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fac2c38fb92040d42c6fa4e13ea32c8770ad9118ff7b572ecae50fdc4cc51d56"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d5eaf062d6faa8bf777916b03a753c8f19a937e187fa6aa88d8569dad16b383"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44b9461fa4e291852f818b0c934c0baf5e04610e915e6f8230a6869f67d90b78"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08d47f0177eaa1da5ea8e2720fbb722ccd36af4e3e9a2ecea9a1a3c1d2098960"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9593eb1fdf06d76afd7d21732cf7c49bc878a71f3da414f7f1ff83193b55911"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c7dfc308c2f0227bff18864e76df383f0544dd5920b71f7ad7bb8c03734fab5"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3012cd8f915d6f67203e0bc6446f4a5283646a362357350c808ea6676819b065"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cc0be1e4677e570867aa3e1a3bec2017e03cda44406c3fb010d07e9d62a4d04"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16497b007cec2fd4f6c1d97b3f5bbcfe52037ad6a106118383ff6c1346d7aad0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62031eb7b7f49ef0f00cc76765d371da26f4fc7e82e8113b72b2dac5bc92aeac"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd713579a42abf9874353a25b08e7b82673ef5f3a3261c536670e323cd64af83"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaa45fc85e741c56d6f1c106a6f20ff43e3bf41ecf0b1429cb1b7708f547f90b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0557cdf52f7099a6f347a06d58a10af1e8415d5426efb911c4c040c922a0aea1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5af23b743bf81e35c17edd7181e88f0359d6512f81e16833229eb985bbbffff"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d88e77beb0b9ecf51f0977828b771105e484eead0ec235e4eed0908fffec24f4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75c53bbf71b45a550f3ea4dab3c57ca3574b04a15f7f8c0542d63d3117467134"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1df377d23c98c9be0240ebfb0e883440cc08d6ab9ff5024da80fbfda6c7f194a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29e5235d36c66c01b90292b32da1984d66e73612bcd0c51f8e64e49f0c11b2e1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"534d459f6cd7667a7f40a3fc592f0a0df502a974d773ee56eed65ad6f303d02a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9757cbb8bccb8720b5e9342981b7674f9be2470ed4e27af10ab3bce645e83ab8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2d2841ad082b99111c0ef316aef5546446631f677488add4eee9c031aeb7254"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24a2882d57121a39860cf80330e34b25249f7c83470fadb322895121194a1b4c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83a915cab88092aac560110741ae29cb631615ac5651ff4fc25cdb2d9c95b383"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebba7332ac505e16eaa6ed9002a990c4476c17ab1453ace46f5475a43d255f42"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ccfbe166987434e65617dcff5dee7796f3d0690ab2f39f74df2ca5dc31810e0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42f1e3a33259bf3288e2afa7498851d73c65614f38fa5d272ec757ddbff7ce96"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af2d308ecc81fc19a6fbd2fc0bd2f2758d0295f8c0877e7225eaafad7592c922"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd6bd2b23f0287d5e920c95366c3493627b4eeaa3661bf26a3b1d22c3224495e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0730ddd2bc0a04d15b2ff7369697d6dec8d359a1978e3cfbc37484427bbdeead"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea7a61b379d74940ef5a9428647b81ff7db64ff95117a5abcb10824bbf27163e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ed24ad630a2ffc90fc80a513a185558fb2207b5579e7781b73ac6fe44ecf800"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c32921cd1a11a411f725cb3a5d5e113ef2675a5778e8c33b71c4f0fdc7384df"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bf2a5302f5fd44a316f5baec4b3d6baa523623f6a7e638e27344007158c599e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27d4c25789b60ca3a4272f3a65308423a1143e12812b3b7ffa2afedc05403f71"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd36306f99c0e534b197a820acc5394fbe56a01cad79cd0c3c35f10dff67750f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80425091e5a0d5a4e17d20515c7ca0d9d6005d2ab76b19d73a647761bff2aae8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68171350d5a96c740311999bc117d82592c5eb941eb6d2856b22401cb5f11650"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a48c0bc7d4cb7ea4e3b4354c4c7fe5a3d78488fd6e6f5f21a1309fd43eb80b53"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e28db50134da26d784d7865d4df6863d99f51a45ed3fd455ea989ed6d4b9165"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23f97ed8c12510301e583c084ed112680e3ef8c128577c5c76cd4b5d829e0425"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"254f3c13c4c7987405f87bfe517d7d11ca819b873fd0a428b7445cd77dea4bef"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5e7c44df09bf1b37e31bb9425ecc6245e2e0e8790d7ebe77d2da399f482acf1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7354b12e8584ba2d2103a13b0ddc64c3062ea138530c3903b1e05441c0eb46d8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4453013da24da0116bee8e832cb19275e3e5a281db3811bc059d73f045643498"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f34ab09ee3fee0352c914bb517c7d8f37cc76fdf51c4e5c50594860ca95cce"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6216109a65f57427b48a7f9009c4b6c7c7e07891e80f45c51161f1bc6f751cf1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"896ee562795ebc745119a00bb72fdad0a2c7aa8d2ba168dc51efbe194a5ab5cd"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"032d58a5ce8d077affb7c2dd11ff5a9e3a390656c4243d459253a3c9da14913c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9056488de6aa3e2bcac720b69b09581fd27c231639600a33291fae17e5ce2e0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"32c61799ea12afd28b6135da666ec933b4279f8feffe94ac81501e920b038c11"},"properties":{"dependency":{"package":"arrow-data","version":"57.3.1","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"0faca7f2fd4d452df7cdd2521c4aa80642aa6ece744473b88a14cf842ced8452"},"properties":{"dependency":{"package":"astral-tokio-tar","version":"0.6.4","advisory":"RUSTSEC-2026-0440","reachability":{"kind":"unknown"}}}},{"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"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":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"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":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"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":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","reachability":{"kind":"unknown"}}}},{"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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"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":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","reachability":{"kind":"unknown"}}}},{"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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.18","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"0897771ffd4e3ceb3419dde32bb5bb1ffcf0f4b413f8009f7ee61b96577e12ed"},"properties":{"dependency":{"package":"smartstring","version":"1.0.1","advisory":"RUSTSEC-2026-0249","reachability":{"kind":"unknown"}}}},{"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":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"3.0.0","advisory":"RUSTSEC-2026-0371","reachability":{"kind":"unknown"}}}},{"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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.14.0","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"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":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"4.2.0","advisory":"RUSTSEC-2026-0370","reachability":{"kind":"unknown"}}}},{"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":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"4.2.0","advisory":"RUSTSEC-2026-0372","reachability":{"kind":"unknown"}}}},{"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":"29b7419d23a77c27500f7fbd2cafa7b771d34780e6050d77b65a7df7344d1586"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"sdk/go/examples/disk/main.go","line":39,"symbol":"os.MkdirTemp"}}}},{"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":"083e7415fff5e1384262ea9068abf1042a0a82a18b3aee86ef5b0d16bd60580f"},"properties":{"dependency":{"package":"arrow-data","version":"57.3.1","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"de929ddabc883a3fc86adf62697bb486d73ff38b93e036ca4f52c2d1045b3d26"},"properties":{"dependency":{"package":"astral-tokio-tar","version":"0.6.4","advisory":"RUSTSEC-2026-0440","reachability":{"kind":"unknown"}}}},{"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":"b84ac9ac202b5f561f628162a351b5f88a6ff6c59dbed5e2227876d5839983fc"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"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":"a49225c5da44908334276127f87c9a07384e87dd53abe60da94f564365bbe019"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"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":"1429b6760ce72e9656ffd0caa0265624b6877c6d3dd16e06f06b3aa90ef1a230"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"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":"4cdacc95f05eeda9fe10e414cdf4f9ce4570cde1af5643fd406e6b8b796d836f"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"10d9709f185e9456c4b9edd725d11dfe2f8c3a84dbf6366c9baa5d493de03202"},"properties":{"dependency":{"package":"hickory-proto","version":"0.26.1","advisory":"RUSTSEC-2026-0487","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0488","RUSTSEC-2026-0489","RUSTSEC-2026-0490","RUSTSEC-2026-0491"],"reachability":{"kind":"unknown"}}}},{"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":"e6a26854319045c3ffb209662184a93842cef0bfc815544f655d15420fe9600b"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"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":"9b42b38c42b59efea76d94a630418b00e7b5a04e6f6f67791737bf672224c0b7"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"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":"30fbafa5d2b884736b6c558d53ff7960b32dd7e320eef87637a07a444f40d81a"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"f68544ec9d1dcf0dd898f1832341aaa40c4713f193b0e4766125eecb199e27b8"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","reachability":{"kind":"unknown"}}}},{"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":"57b40caa2a8141ddbf92b91fdbd045172e6037e520bc86656a9dac69bf3679a7"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.18","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"aeb8fca30d70b25ecfd8b0d9db52a126c35fa03e65adb276eb07e35c60cfd8c4"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c759a033f608e69a7300aaec836555dcad8a226d8a15bcf7843d0b70cfeaca1d"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"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":"e279edd4b3a16230b1155e6df7547e90f5bd9715fabc4b13f9795442e366a3cd"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"11afb2f87b9db9e432294a47cffa65aec9bb969dfe520b067765ef5eed170e6a"},"properties":{"dependency":{"package":"pageant","version":"0.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c4252d9ecfca3cf44dffbbe4342dfc88e3b3a1b5e8024502ad7c8e1b6f99463a"},"properties":{"dependency":{"package":"russh","version":"0.65.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"365e324a13ad46f1bae4c50576184c32b9456100fa505e0e5ba5c511f5a2bf72"},"properties":{"dependency":{"package":"pageant","version":"0.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"40c0ca817099d45d2ff7e8a97d49a9ee968136826d033f4931538091d9ef96d6"},"properties":{"dependency":{"package":"russh","version":"0.65.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"8aa06a77b1b0a97987d27286a1ee8b9ff0272d8f7b31a19defd19cf35fd977cf"}},{"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":"818569c7dbc7a3baec54a8eb0ba5c567e0dca9ecdd4d88a7f0e304e6e89927b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"908761ab57708133bf7ccec7ee1504d89ef1eaade9208cc3a0c493a51249c2e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 779 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; 779 of the 1027 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: sdk/go/fs.go. 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":"sdk/go/fs.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"657dd7250d48bc5b7d083365386b8e6349b2a5ca92ff6b18cb9c682e668bbca4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 spawn.rs: \u0060crates/protocol/lib/lib.rs\u0060 (context crates) and \u0060sdk/rust/lib/runtime/spawn.rs\u0060 (context sdk) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608402def4\u0060 fix(filesystem): isolate single-file mounts (#1464); \u0060e36180b9\u0060 fix(runtime): move guest bootstrap off kernel command line (#1375); \u00607d4bf321\u0060 fix(run): preserve detached startup semantics (#1004) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/lib/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9c85cd77c64d429c76547f334955112a31951bba31d05666b925b444092e9d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sandbox_builder.rs \u2194 helpers.rs: \u0060sdk/node-ts/native/sandbox_builder.rs\u0060 and \u0060sdk/python/src/helpers.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060fde6b85c\u0060 feat(tls): add opt-in application certificate trust helper (#1782); \u0060ae819743\u0060 fix(sdk)!: type guest paths as strings and fix Windows path handling \u2026; \u00608eddf50d\u0060 revert \u0022feat(sdk): rename overlay sizing to disk_size on the sandbox \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/native/sandbox_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4312cc6b62bcd676f16f5383c77bd5184bc929519fd2daf4c8d7767de66a573a"}},{"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":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: LabelCache.get_or_parse: \u0060LabelCache.get_or_parse\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/metrics-collector/lib/core/label_cache.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6250ee87e38efd569847c082b2a26cd6ed2309bc93ab4fabc93b6b71646bf2e4"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 11/15 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/agentd\u0060, \u0060sdk/node-ts\u0060, \u0060sdk/python\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/gomod/uv/gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060gomod\u0060, \u0060uv\u0060, \u0060gitsubmodule\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"886ca6654d769392f5703f7c3c080d40b565c55c1400eadb643ad012e9126720"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060main\u0060 is async and calls urllib.request.urlopen \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/net-ports/main.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed8123bd1184e4286d7692c41666bcfc731affa9ab9fabe273d6efef421a24c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060forward_stdin\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/lib/commands/exec.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca5b6e193ac037afe4240b7bc649d61bbe31cad5003fc7458c31b10f441b981"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (94 identical lines \u00D7 2 files): sdk/node-ts/src/fs.ts:1 \u00B7 sdk/node-ts/src/volume-fs.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 94 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ab36b7132a0b49db553ce3abaae496bc19c98db9857bb818365ddb7f5c40e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): sdk/node-ts/src/sandbox-handle.ts:199 \u00B7 sdk/node-ts/src/sandbox.ts:633 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98915323083ff599dbcb991d51cf2aff25d1701e121047c7144591f777611d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): sdk/node-ts/src/index.ts:220 \u00B7 sdk/node-ts/src/index.ts:276 \u2014 the two spans are one implementation copied and then locally edited \u2014 127 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/index.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ce12452ca4dd41bf75a0c20ed840d1be86373d25ac5e922bbffd05ffb2015b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): sdk/node-ts/src/logs.ts:149 \u00B7 sdk/node-ts/src/metrics-stream.ts:7 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/logs.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6598088c381db70a3d35715f81690e86f475b9d485b64f518097113864ed2f06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3 locations): sdk/node-ts/src/exec.ts:50 \u00B7 sdk/node-ts/src/fs.ts:60 \u00B7 sdk/node-ts/src/volume-fs.ts:59 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/exec.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde79cecece3d0bde732d675d175fbcbc0a1099461f685603e056c453a74f6ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): sdk/node-ts/src/sandbox-handle.ts:102 \u00B7 sdk/node-ts/src/sandbox.ts:577 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"24736e88377e39ffedb6493601541b03edd093b03d58a678efe1b285b092dd2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): sdk/node-ts/src/sandbox-handle.ts:273 \u00B7 sdk/node-ts/src/sandbox.ts:701 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd6562cab4768abcc3a3d652af57fc03b86caea5d87612957ff364de47b559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): sdk/node-ts/src/sandbox-handle.ts:359 \u00B7 sdk/node-ts/src/sandbox.ts:767 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edd2a4cf0d84275a7e83d48d71728b490b31bf2caa47273493defa3289d10f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): sdk/node-ts/src/snapshot-handle.ts:87 \u00B7 sdk/node-ts/src/snapshot.ts:263 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/snapshot-handle.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"89369d984e11d4831c90ef7bf5d57c8c9903f21b6d9522b9c844b1065538f906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): sdk/node-ts/src/sandbox.ts:439 \u00B7 sdk/node-ts/src/sandbox.ts:456 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7070ec2f54f3df23b55b209fcec51382ccba8838eacecba79fc197dbe06b689e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): sdk/node-ts/src/internal/napi.ts:375 \u00B7 sdk/node-ts/src/internal/napi.ts:421 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"064d27844b8c86f9b6cd8931057c7a983729a3faa1e0d787b1946e06fd5af126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/protocol-client/typescript/src/node.ts:35 \u00B7 packages/protocol-client/typescript/src/websocket.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/node.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"332d531f41674bdde91dd50498b8cdaf191778b848f30392398166e5c2456a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): sdk/node-ts/src/agent.ts:59 \u00B7 sdk/node-ts/src/agent.ts:72 \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":"sdk/node-ts/src/agent.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac47cb0b3e01d875d6fbe98d472d881f786487f2625c7b9996731e82183201"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): sdk/node-ts/scripts/prepare-platform-package.mjs:33 \u00B7 sdk/node-ts/src/internal/resolve-binary.ts:6 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/scripts/prepare-platform-package.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79de5d6b332162933c4414519a61434cbef010d197d2b84e0df2e1036470564"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): sdk/node-ts/src/setup.ts:83 \u00B7 sdk/node-ts/src/setup.ts:95 \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":"sdk/node-ts/src/setup.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a57ca864e7f37811eeccbd1e8e4c22fe61a10e05fd9c64ebef29758fd562b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): sdk/node-ts/src/snapshot-handle.ts:130 \u00B7 sdk/node-ts/src/volume-handle.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/snapshot-handle.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce6ef04123c1826a1191095ad0c2ebc5a735f929f0c82ac2920345559ac63d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/control-client/typescript/src/attempt.ts:34 \u00B7 packages/protocol-client/typescript/src/timing.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/attempt.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cacb5f169acc6f11136d30ec21ba45e5269eaf1e0420da456be1adb21fc0b05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/control-client/typescript/src/json-reply.ts:42 \u00B7 packages/control-client/typescript/src/json-reply.ts:56 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-reply.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b257330ad7d62fd726ffeac111639572e3d066cea3d66eef8136340f1dec8029"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/protocol-client/typescript/src/client.ts:91 \u00B7 packages/protocol-client/typescript/src/client.ts:107 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/client.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d632e6fc948b84fff6189840e342e5c6ee9dba8f23725ac6d5e2977b71e7f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/control-client/typescript/src/json-reply.ts:64 \u00B7 packages/control-client/typescript/src/records.ts:159 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-reply.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c95d61ef9b602660cb4aa8cc76df79d5d764bb6ee04de6c41a6abadc9cd723"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ci/test-npm-release.mjs:14 \u00B7 scripts/ci/test-npm-release.mjs:54 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/test-npm-release.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e77886556303249a9e8ac4766c61a3e10c933f1e1b536c97cb4e99c9b30a48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/control-client/typescript/src/request.ts:39 \u00B7 packages/control-client/typescript/src/request.ts:47 \u00B7 packages/control-client/typescript/src/request.ts:56 \u00B7 packages/control-client/typescript/src/request.ts:71 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/request.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e94ef5b01ab2a3eb8ec101fa5d843e6c5bbcaf04270b4290345fcaa9c96f367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/control-client/typescript/src/request.ts:193 \u00B7 packages/control-client/typescript/src/request.ts:201 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/request.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebc9b6577e7c03561f3e12a0a10cfcb8af7e1a240b4a01494b7608f5f36f96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/protocol-client/typescript/src/client.ts:126 \u00B7 packages/protocol-client/typescript/src/stream.ts:31 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/client.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e057af6e07207e14d37624bbf09e1d2d628f7400c23fc91b4579ec799ed6552"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): sdk/node-ts/src/internal/napi.ts:240 \u00B7 sdk/node-ts/src/internal/napi.ts:304 \u00B7 sdk/node-ts/src/internal/napi.ts:1142 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc406060268e2d3422ddcc5628839728fd0fb492caf328b520f54c0cbdce0b8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/control-client/typescript/src/request.ts:47 \u00B7 packages/control-client/typescript/src/request.ts:200 \u00B7 packages/control-client/typescript/src/request.ts:207 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/request.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"824c86c340d73756b349ae4966ba22ed3c3329bbbccea9515267a82de018102b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/protocol-client/typescript/src/node.ts:26 \u00B7 packages/protocol-client/typescript/src/websocket.ts:57 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/node.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a83eb64c759061923d06d03bf44a1457f285992f40f5d69943a562d48ac10f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): sdk/node-ts/src/internal/napi.ts:358 \u00B7 sdk/node-ts/src/internal/napi.ts:405 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb2ed832a8f3e9feed72ccdbca09b0412e55557513564df40e53bf62423f0f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): sdk/node-ts/src/sandbox-handle.ts:60 \u00B7 sdk/node-ts/src/sandbox.ts:250 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a207a6e4e02f431fcd84a5577a294d63d8ba7485242b95c47095a3d6756ff0c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function itemEnd (cyclomatic 20, cognitive 36): itemEnd has cyclomatic complexity 20 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"017031b86be7bc3c620f20a8d9e345262ecaccd32b8ce89932a6cae4b4527d39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exchange (cyclomatic 19, cognitive 27): exchange has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-session.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b6ed282ec13c9e5c8ca8d1ae5008257c27cd089a23082f2ca0a295567737ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 36): (anonymous) has cyclomatic complexity 18 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-value.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc04c3013dab8f3efd7ac23363c60380db49767b93910c286ceaffb87af2f3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function labelPullRequest (cyclomatic 18, cognitive 27): labelPullRequest has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/release-notes.cjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae7fef02a496144422389447b60067bf1eb9047b9abbc9f3b8895c49516d4c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 18, cognitive 22): normalize has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/wire.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb8f0a0052d6252c7388c9f16f14f839d4fe9783640822c2b183a14a2c7eabd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 34): (anonymous) has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/test-release-context.cjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9f125c7617c16db0981000e0497cf75229cba37cba609193b213ab198ef12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveReleaseContext (cyclomatic 15, cognitive 17): resolveReleaseContext has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/release-context.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"92547bee0c5050619e6dfbd0a692a1a7401e1217846c0e2528784dc64dcb700d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 23): (anonymous) has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/control-client/typescript/src/json-value.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7679432c3d0f074659c39ad118fdd87d607ebe0998b445282c8449ee2aa3548"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function state (cyclomatic 13, cognitive 19): state has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/snapshot.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b79f3b0b5add16b5967169cda474228a12e008d593473ddc0f95d053c8f9e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMsb (cyclomatic 13, cognitive 12): resolveMsb has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/bin/microsandbox.cjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d855b8adfe022a0ab85b33dfe4777ad71b626ce7a1bbcc47ba266385e5b76638"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultLimits (cyclomatic 13, cognitive 11): defaultLimits has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/protocol.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be2926fed3ff02559695fc8ee5371102eb02a936c510d822904872bd389c98c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 28): (anonymous) has cyclomatic complexity 11 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/test-release-context.cjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa37c1638ebb04e09c83d2bd2e27509373eba228a2ef7974e3068c6568fc29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 11, cognitive 18): read has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-client/typescript/src/websocket.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"551f6157db1a504a29f3de0ccb6e800b7568dd4a71f8f4901a3d2f687ba52ea9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectHostTriple (cyclomatic 11, cognitive 10): detectHostTriple has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/scripts/prepare-platform-package.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"081d8f05ebe207984b5560bcf00a9c929545b187ca94e9f5c1b2d89bca883fcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectTriple (cyclomatic 11, cognitive 10): detectTriple has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/resolve-binary.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebac6c19c52a20db3a2ec5b1adbd00e9238358a0acf225f3a37c0c94cc8a5408"}},{"ruleId":"R3","level":"warning","message":{"text":"sdk/node-ts/src/internal/napi.ts: 1383 lines of code: sdk/node-ts/src/internal/napi.ts has 1383 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad2d507b192ce0497af6ef4b5c8b987b497c61f490052c636bf9821b3e62c53"}},{"ruleId":"R3","level":"warning","message":{"text":"sdk/node-ts/src/sandbox.ts: 690 lines of code: sdk/node-ts/src/sandbox.ts has 690 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92a496398ed2afa55062656dd1353eb4c912e6f134e40b7c98ccb2ed5d51155"}},{"ruleId":"R3","level":"warning","message":{"text":"sdk/node-ts/src/index.ts: 606 lines of code: sdk/node-ts/src/index.ts has 606 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acc1b989bf96e42ef9635727bc403c6e79e051a7edae66b1e60d86d64997601"}},{"ruleId":"R3","level":"warning","message":{"text":"sdk/node-ts/src/snapshot.ts: 508 lines of code: sdk/node-ts/src/snapshot.ts has 508 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/snapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882572a48dee4f52ea457ad5361b2aa40c4bbce48cbc8da08759afb689d2acb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/scripts/prepare-platform-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca84a96a305ecd625ba9639b88110a734ecb75d63d7b5223ec4fc2a27c186ed"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027cbor-x\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-fixtures/agent-ts-v5/message.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"718e30e7d5e54dc270b9a269e0772b6eeccbb259742b91a1b8ba36f2b7b588e7"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027rolldown\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-fixtures/check-browser-package-roots.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a0323c34de855bcd6638d48215a851557c66c50ed6367b27ff78d3e7da00a"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027typescript\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/protocol-fixtures/check-packed-protocol-consumer.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9208828a23317c29accde5cc26995cb1ae2b80c5b3ef96b6dffd6bb698b80752"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): sdk/node-ts/src/internal/napi.ts \u2192 sdk/node-ts/src/modify.ts \u2192 sdk/node-ts/src/internal/napi.ts (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/internal/napi.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f3db24aca80643b3f9e00420032acde30f805ffe61fdd679d293a53849ee0f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): sdk/node-ts/src/sandbox-handle.ts \u2192 sdk/node-ts/src/sandbox.ts \u2192 sdk/node-ts/src/sandbox-handle.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/node-ts/src/sandbox-handle.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"60073accc58cc4e5688f7ef3ecd1629e2a2d6ecf1abd8244ef89548da25b1bb5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/cloud-backend/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/cloud-backend/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e820751753977c2124bb9ccc4c2c3fe360942f5b3ecca8559ccf9d4ed333c695"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/fs-read-stream/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/fs-read-stream/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"760fc7ac4870025d96afbc9aca16041b5ab72689d8f3c0e6f655a3fea60735d0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/init-handoff/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/init-handoff/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bba2741eecf87b79291f92b509772df1a5961f7796f129c5986c11a7d7d1b6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/metrics-stream/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/metrics-stream/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3992def06f44d65bb1a26bdec121e4c43df26cb4456f78183b2e269f84583ec0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-basic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-basic/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"61adbdd06ef9920527892485949b48c80b1f83d6a457d2f90e9e634b3627c05d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-dns/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-dns/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70e81e0065e7ce7da43fb804f10cdf2b738671b297cb252dab7d4dfdef2ea1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-policy/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-policy/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"963d2366235a08002fe8050e007f72ba9d14bd679bee63f57bcca16e69488730"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-ports/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-ports/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"59deaaf2a06d9b45f8ece3016c040f10dcd31c164a60ac9296ae4bba6cd32d67"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-secrets/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-secrets/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4eaab44d17372b855def980cb1ff8f351f8e15b48965cff599358effd7601e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/net-tls/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/net-tls/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bf64fcbe76a20a40d7df1fce2a079b17d26e71086cb78dc830932901c2e17a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/root-bind/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/root-bind/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8866df1c6c721bd0905a51bb0cad680b2306cdfc7d264e8a881e4fd8bd5e8e5b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/root-block/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/root-block/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ea702fabb4fdc366daa4233f486b57a664e14cb9f860bf2b72f04a152362d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/root-oci/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/root-oci/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2050154d0b249608a2359bd04eb8c87e0e2282a0d125a4f40222c87c59286040"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/rootfs-patch/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/rootfs-patch/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59480d978ac2dcbe49c6b71f0608059810a1d6901c31c90011090a7f216125d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/snapshot-fork/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/snapshot-fork/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5e9e59c1a739236a08a1b7249b18e4d9b4a2e073eada6dfd59a0fb72ffdd9c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/volume-disk/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/volume-disk/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbc8bb265f4373688cf7bf19f5a2ba1cc1fb4e95986f740133de8589ba5c545"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/typescript/volume-named/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/typescript/volume-named/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e8a7648c844dbe12934e5ca8edb601a26cfcc5ccb5cdc5f6180cf0e968243a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(maxBytes) || maxBytes \u003C 1\u0060 appears character-identically in 2 files \u2014 packages/protocol-client/typescript/src/node.ts, packages/protocol-client/typescript/src/websocket.ts. 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":"packages/protocol-client/typescript/src/node.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08df2db761e609f09ad595f206be99a1c7099c23cc7cc72d01c985fa7952fbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Path(args.label).name != args.label or args.label in (\u0022\u0022, \u0022.\u0022, \u0022..\u0022, \u0022produce\u0022)\u0060 appears character-identically in 2 files \u2014 scripts/smoke/cli/legacy_storage_preview.py, scripts/smoke/cli/legacy_storage_repair.py. 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":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1bb2d7560ad62de844f03b5deeb2b90c1c4e7330e2f8ceea3781d5715c6014"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code is None or code \u003C 0 or code \u003E 255 or (code != 0) != expected_failure\u0060 appears character-identically in 2 files \u2014 scripts/smoke/cli/branch-batch.py, scripts/smoke/cli/snapshot-branch.py. 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":"scripts/smoke/cli/branch-batch.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c0b5079e89721d2c15a9de5e31c838e479c9412549f9c113f5bf82ea03d624"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected is not None and result.returncode != expected\u0060 appears character-identically in 2 files \u2014 scripts/smoke/cli/cow-memory-lifecycle.py, scripts/smoke/cli/direct-branch.py. 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":"scripts/smoke/cli/cow-memory-lifecycle.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e147ab9739421179181dd2b851e61ad0a44c86182f9e4d3ad59209aa07a7c204"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info(job)[\u0022state\u0022] == \u0022running\u0022 and not info(job)[\u0022stdin_closed\u0022]\u0060 appears character-identically in 2 files \u2014 scripts/smoke/managed-job-terminal.py, scripts/smoke/managed-jobs-lifecycle.py. 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":"scripts/smoke/managed-job-terminal.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07d2848d80853178a7983f580aaae322429d2707d419fafb9457b0f58792ec2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060interactive.returncode == 2 and \u0022Couldn\u0027t safely repair\u0022 in interactive.stdout\u0060 appears character-identically in 2 files \u2014 scripts/smoke/cli/legacy_storage_preview.py, scripts/smoke/cli/legacy_storage_recovery.py. 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":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a37e8f2c85ed488c68e66f473d6bbf38bd2fa8050acdb0156f1b93e6434dd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060refused.returncode == 2 and \u0022investigation\u0022 in refused.stdout\u0060 appears character-identically in 2 files \u2014 scripts/smoke/cli/legacy_storage_preview.py, scripts/smoke/cli/legacy_storage_recovery.py. 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":"scripts/smoke/cli/legacy_storage_preview.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e3713dacfd5cb5d3c6578469d7b0e6e91bd1356dfa601e04886bcee8177129"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!matches!(components.next(), Some(Component::Normal(_))) || components.next().is_some()\u0060 appears character-identically in 3 files \u2014 crates/image/lib/snapshot/migration.rs, crates/runtime/lib/checkpoint/local_disk.rs, crates/runtime/lib/checkpoint/migration/namespace.rs. 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":"crates/image/lib/snapshot/migration.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"898cf226b7ad2b255fc4e9798282d53e02858a8fa98465c28a89f3587d75eb20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_dir() || metadata.file_type().is_symlink()\u0060 appears character-identically in 3 files \u2014 crates/runtime/lib/client/ipc.rs, sdk/rust/lib/backend/local/snapshot/migration.rs, sdk/rust/lib/storage/usage.rs. 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":"crates/runtime/lib/client/ipc.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"193855787fe5562ca2b9d7e57209e3416c515620f83836ec3ae6d0ff0d913c9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!seconds.is_finite() || seconds \u003C 0.0 || seconds \u003E= u64::MAX as f64\u0060 appears character-identically in 2 files \u2014 sdk/node-ts/native/restore_builder.rs, sdk/python/src/helpers.rs. 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":"sdk/node-ts/native/restore_builder.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecd1f4e4cf359bef085270420b1f1e4b1077ef36879435cee39958f4c78fbcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!waiter.is_finished() \u0026\u0026 Instant::now() \u003C deadline\u0060 appears character-identically in 2 files \u2014 crates/image/lib/cache/lock.rs, crates/image/lib/storage_lease.rs. 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":"crates/image/lib/cache/lock.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec9c284649e70a28567125a8e36eea471e85a8260964330426dc0e77276d55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!warned \u0026\u0026 started.elapsed() \u003E= Duration::from_secs(5)\u0060 appears character-identically in 2 files \u2014 crates/image/lib/cache/lock.rs, crates/image/lib/storage_lease.rs. 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":"crates/image/lib/cache/lock.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae576472e2202f18e3e85bd56b5abbd8ad54a43bc3c80077161437949d3a072"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bindings.root.is_none() \u0026\u0026 bindings.owned_disks.is_empty()\u0060 appears character-identically in 2 files \u2014 sdk/rust/lib/runtime/storage_aliases.rs, sdk/rust/lib/setup/storage_repair.rs. 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":"sdk/rust/lib/runtime/storage_aliases.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b371602c802e6ed603dce9c14d63f7aa41eb35be15ed5b9ff44158f69b3dac59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060component.is_empty() || component == b\u0022.\u0022\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/passthroughfs/unix/inode.rs, crates/image/lib/archive/tar_ext.rs. 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":"crates/filesystem/lib/backends/passthroughfs/unix/inode.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77c88c132772b35ac3b28b72339cbf426a304e15b5f606b0f77ed3f79e0c52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060guest_parent == ROOT_INODE \u0026\u0026 name == STAGING_DIR_NAME\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/dualfs/dir_ops.rs, crates/filesystem/lib/backends/dualfs/lookup.rs. 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":"crates/filesystem/lib/backends/dualfs/dir_ops.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2fe199b9697f548aa74a9b3ba30fd9ec58f250f09b04c8b18208a18c7e7d73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inode.inode == 0 || inode.inode == 2 || !inode_ids.insert(inode.inode) || !paths.insert(inode.components.clone())\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs, crates/filesystem/lib/backends/passthroughfs/windows/mobility.rs. 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":"crates/filesystem/lib/backends/passthroughfs/unix/mobility.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dde9da9919930a65be397cb532a3051360b0985fe7756df730e0a0ea6c82edc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(profile.numa, NumaPlacement::Inherit) \u0026\u0026 matches!(profile.memory, MemoryPlacement::Inherit)\u0060 appears character-identically in 2 files \u2014 crates/runtime/lib/runner/cpu/mod.rs, crates/runtime/lib/runner/cpu/planner.rs. 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":"crates/runtime/lib/runner/cpu/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c901ba4bcdc0fcb84003e49fd31d4271adc515ee9478b1adc5ef40ccba2656d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.contains(\u0022no such table\u0022) \u0026\u0026 message.contains(\u0022seaql_migrations\u0022)\u0060 appears character-identically in 2 files \u2014 crates/cli/lib/commands/self_cmd.rs, sdk/rust/lib/backend/local/mod.rs. 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":"crates/cli/lib/commands/self_cmd.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd66d5a440cc0cbfa90dca0aec48825696dd946a3ae3c64213ccc191a0f0020"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.contains(\u0027/\u0027) || name.contains(\u0027\\\\\u0027) || name.contains(\u0027:\u0027) || name.contains(\u0022..\u0022)\u0060 appears character-identically in 2 files \u2014 crates/cli/lib/commands/install.rs, crates/cli/lib/commands/uninstall.rs. 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":"crates/cli/lib/commands/install.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ad221c128fec5c79e4c0edd9fbc5bc59a48d0a6621e08148f7bbc978b5fea8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_bytes == b\u0022.\u0022 || name_bytes == b\u0022..\u0022\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/memfs/dir_ops.rs, crates/filesystem/lib/backends/passthroughfs/unix/dir_ops.rs. 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":"crates/filesystem/lib/backends/memfs/dir_ops.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e52f1f8b20c726b7fc91d2b52c717bed29ae7aa5fa55e7f8dc0c09788cda88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ok != 0 \u0026\u0026 exit_code == STILL_ACTIVE as u32\u0060 appears character-identically in 2 files \u2014 crates/metrics/lib/registry.rs, crates/utils/lib/process.rs. 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":"crates/metrics/lib/registry.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a0a3f081443fb65434cb0a62c40ffb1785a79f4ab51eb7fad6c15579c69ac0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner_id \u003C id_start || owner_id \u003E= id_end_exclusive\u0060 appears character-identically in 2 files \u2014 crates/agentd/lib/agent.rs, crates/agentd/lib/fs.rs. 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"72be009cea0e19721ebe3b3bec46a7789963f6800ad3a884b7672f28333c1548"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent == ROOT_INODE \u0026\u0026 init_binary::is_init_name(name.to_bytes())\u0060 appears character-identically in 3 files \u2014 crates/filesystem/lib/backends/memfs/create_ops.rs, crates/filesystem/lib/backends/memfs/mod.rs, crates/filesystem/lib/backends/memfs/remove_ops.rs. 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":"crates/filesystem/lib/backends/memfs/create_ops.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e278705ab88c0d7d9d65d0178bebec895e12c92c7bac2cfbbd5903cbae0de86e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload_len == 0 || payload_len \u003E MAX_BULK_RECORD_PAYLOAD as usize\u0060 appears character-identically in 3 files \u2014 crates/agentd/lib/agent.rs, crates/protocol/lib/codec.rs, packages/agent-client/rust/lib/local_shm.rs. 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":"crates/agentd/lib/agent.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedb5481b0582e6d2b0b2d5fa3af24e85131a18a666c9a27c4eef39c5c22d0e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plan.dir_data \u0026\u0026 plan.data_block_count \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/image/lib/erofs/fsmeta.rs, crates/image/lib/erofs/writer.rs. 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":"crates/image/lib/erofs/fsmeta.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f039d7f544a1605aa09c938c87dc9ff729fd8e1e72960808ccc3d69ba578687f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060replay_bytes.is_some() \u0026\u0026 cursor.is_some()\u0060 appears character-identically in 2 files \u2014 sdk/node-ts/native/jobs.rs, sdk/python/src/jobs.rs. 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":"sdk/node-ts/native/jobs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"722269f2653f791654e1f18f325e8b9a0a47cb771a0925b4d014a3a4b7f9d756"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cfg.inject_init \u0026\u0026 inode == INIT_INODE\u0060 appears character-identically in 5 files \u2014 crates/filesystem/lib/backends/passthroughfs/windows/create_ops.rs, crates/filesystem/lib/backends/passthroughfs/windows/dax.rs, crates/filesystem/lib/backends/passthroughfs/windows/file_ops.rs, crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs. 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":"crates/filesystem/lib/backends/passthroughfs/windows/create_ops.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf1edcacdc0c0057da0794e1842b87211cdfe0da3c65c30d9c42bf7d2a0f1f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cfg.inject_init \u0026\u0026 inode == INIT_INODE \u0026\u0026 handle == INIT_HANDLE\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/passthroughfs/windows/inode.rs, crates/filesystem/lib/backends/passthroughfs/windows/ops.rs. 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":"crates/filesystem/lib/backends/passthroughfs/windows/inode.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a9cc3df5eb1cacb831d3fb2a4d12b8586216925b87c4aca2e0501882c9caa7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cfg.writeback \u0026\u0026 capable.contains(FsOptions::WRITEBACK_CACHE)\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/memfs/mod.rs, crates/filesystem/lib/backends/passthroughfs/unix/mod.rs. 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":"crates/filesystem/lib/backends/memfs/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"42805fccebea720fd0892304497dea5b5af0d6938391d0876d9b193fdf581a50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.entry_count.load(Ordering::Relaxed) \u003C next_sweep_size || self .next_sweep_size .compare_exchange( next_sweep_size, usize::MAX, Ordering\u2026\u0060 appears character-identically in 2 files \u2014 crates/image/lib/async_gate.rs, crates/image/lib/storage_lease.rs. 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":"crates/image/lib/async_gate.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8896fb4d998f186523746ee85e1ca4f39d98cfc8a51fded5507afe45efacb76a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::fs::remove_file(lease_path) \u0026\u0026 error.kind() != io::ErrorKind::NotFound\u0060 appears character-identically in 2 files \u2014 crates/runtime/lib/runner/cpu/allocation.rs, crates/runtime/lib/runner/writeback/admission.rs. 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":"crates/runtime/lib/runner/cpu/allocation.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd8e6c6b879705f8a0020d904ab6a2e3425a9bbca73ff200071af9c6915d99d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060valid.contains(SetattrValid::SIZE) \u0026\u0026 valid.contains(SetattrValid::KILL_SUIDGID)\u0060 appears character-identically in 2 files \u2014 crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs, crates/filesystem/lib/backends/passthroughfs/windows/metadata.rs. 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":"crates/filesystem/lib/backends/passthroughfs/unix/metadata.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba92ef7a521beb49a5e204c3cb0629189298231082efb73bea415a4f4e5f11eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060virtual_size == 0 || !virtual_size.is_multiple_of(512)\u0060 appears character-identically in 2 files \u2014 crates/image/lib/checkpoint/compact.rs, crates/image/lib/checkpoint/qcow.rs. 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":"crates/image/lib/checkpoint/compact.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fefdbd6b6de779155c67d8fa0f254af3ef9a005681d2bc8a8871aaf071fce8"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets \u003CNullable\u003Eenable\u003C/Nullable\u003E for it: a file is enabled only by its own \u0060#nullable enable\u0060, by a Unity \u0060csc.rsp\u0060 with \u0060-nullable:enable\u0060 for its assembly, or as a file-based app (\u0060#:\u0060 directives) whose \u0060#:property Nullable\u0060 does not turn it off. NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060subtree_size\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/filesystem/lib/backends/passthroughfs/quota.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9d105ed2537071a4183792c11011be2ba747d765f5b3b0be7a1d88b796579a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serve_tls_deny\u0060 turns every \u0060Err\u0060 into \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/network/lib/engine/tls/proxy.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e89601170141a2fe6bdc1393f75f26e6905e7944a1beacc6e09285cd40f6ae"}}],"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-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"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-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":276,"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."]}]}