{"$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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"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":"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":"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":"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 162): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 162 (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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe25249f7e4b0e81b88db11be0985f911ebaae697baf9bacc798933e6723ac5f"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 109): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 109 (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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdecff9f4f8766697f73e51e6306a9e278602abf938d9beecc3aed2da3903fde"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::bin::miri::main (cyclomatic 92): miri::bin::miri::main has cyclomatic complexity 92 (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":"src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6e9574844e51624cab6cc2f617f06beb09336913f68619d502e8426d32d1e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExtPriv::emulate_foreign_item_inner (cyclomatic 75): EvalContextExtPriv::emulate_foreign_item_inner has cyclomatic complexity 75 (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":"src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23714f91d930d0e5b3d4c13e69611bec364231ced5bed8f21cd2588a181456a"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::diagnostics::report_result (cyclomatic 47): miri::diagnostics::report_result has cyclomatic complexity 47 (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":"src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"60315a64f89e47d98e0fa8845e6b1f375131f1b2ddb27bb542286ceb65834b9e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 45): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 45 (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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"93379ac234fe4ea2c292ab59fbeb9a6335e2a8e5694792dbca8817cc1c0ff587"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 44): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 44 (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":"src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb8265e1be61f3e3e3383067f75b5e0606b5ebf4d5ebb7780dcf0e6d161d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::open (cyclomatic 41): EvalContextExt::open has cyclomatic complexity 41 (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":"src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4767bca2b1ec62e08e37f235e74f76135478c6e99deef8d76d81817c2b31c802"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 41): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 41 (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":"src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d339af72bd8057b88dedcda0387b36e8c8daa8c56ea4ef6ad5d42a912e86e777"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_miri::phases::phase_rustc (cyclomatic 37): cargo_miri::phases::phase_rustc has cyclomatic complexity 37 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cd38d257c3fafb559ed957cf36489b22dc0b023a219299bf0bf58969065986"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse2_intrinsic (cyclomatic 37): EvalContextExt::emulate_x86_sse2_intrinsic has cyclomatic complexity 37 (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":"src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3477da89b37c427116b5d3808feed56cc8ae597068b3e34fac5c060ab5e0f4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::CreateFileW (cyclomatic 36): EvalContextExt::CreateFileW 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":"src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a987020794fa217c5fc2b81d45798a8ecc76f821ff2038fa338a6da8658152cd"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_math_intrinsic (cyclomatic 35): EvalContextExt::emulate_math_intrinsic has cyclomatic complexity 35 (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":"src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aea6a1945ca26105c1e9f4b62d84ac78b2321e8d90ce1832917736078b4330"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_aarch64_intrinsic (cyclomatic 34): EvalContextExt::emulate_aarch64_intrinsic 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":"src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10a9a220503f624e3742b0c44f919666bbf135d023462b599d59f46cf1d3af"}},{"ruleId":"D1","level":"warning","message":{"text":"MiriMachine::emit_diagnostic (cyclomatic 34): MiriMachine::emit_diagnostic 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":"src/diagnostics.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3dfc0e496ef7b205895c4900937af816ceaa4d233e053b5c5dbcd38b240f55"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx_intrinsic (cyclomatic 31): EvalContextExt::emulate_x86_avx_intrinsic has cyclomatic complexity 31 (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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d22b9093614cc1caabd645c8ef0512b65f5c38dcc05f2be2a979e84d314b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse42_intrinsic (cyclomatic 30): EvalContextExt::emulate_x86_sse42_intrinsic 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":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd13cdcf6631ccb8c7dfc3478ce867b9dd377d905330a7634ab80746c0507fda"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::math::fixed_float_value (cyclomatic 29): miri::math::fixed_float_value has cyclomatic complexity 29 (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":"src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f5517ad208f72053b749f1b1b2132f9e4e7e7583d159add6ea0944965daab1"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_miri::phases::phase_cargo_miri (cyclomatic 28): cargo_miri::phases::phase_cargo_miri 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":"cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b087a10dc5a266a2a3faaf21891754e1096bc317986f8149defa6d4e6393e5"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx2_intrinsic (cyclomatic 28): EvalContextExt::emulate_x86_avx2_intrinsic has cyclomatic complexity 28 (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":"src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ae16c0882ae9bd257736a5307a783207b360eb3eb9e113a6e3d93bfc5e1272"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::intrinsics::x86::sse42::compare_strings (cyclomatic 27): miri::intrinsics::x86::sse42::compare_strings 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":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20bbe9e6c94b43ef2a0938ed2f1cebfabccb5c9210a7f445a87b86d6ea9b4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx512_intrinsic (cyclomatic 25): EvalContextExt::emulate_x86_avx512_intrinsic has cyclomatic complexity 25 (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":"src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"047f4e22f46386abd3796a277a9f390f2db5410200029e1fdab3a0886eebc088"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse_intrinsic (cyclomatic 25): EvalContextExt::emulate_x86_sse_intrinsic has cyclomatic complexity 25 (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":"src/intrinsics/x86/sse.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f06049e47b3e5b0eeafd3b8edae3fe4414fd5a7b64ee01c6ef7a3effea653"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_miri::setup::setup (cyclomatic 24): cargo_miri::setup::setup has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f521065d7ab84bf94ebf8b61ee4f0c0ba88779863ef111bb254e1becdd19c4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_intrinsic (cyclomatic 24): EvalContextExt::emulate_x86_intrinsic 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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3ddc6eb32e9a9e6bc15a3f6d613207a52cce8361e63ac9581a41600b6cc44"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_simd_intrinsic (cyclomatic 23): EvalContextExt::emulate_simd_intrinsic has cyclomatic complexity 23 (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":"src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc3c35c2fabd30062f499a4e77e2476bc70ff0ba5114ad2441e56845e60c81"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 23): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 23 (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":"src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e88439a72f52611be5b83c6dd099dc544e1e43951c0044bf424517d6b0f3edc"}},{"ruleId":"D1","level":"warning","message":{"text":"PrirodaContext::render_source_shaped_op_inner (cyclomatic 22): PrirodaContext::render_source_shaped_op_inner 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":"priroda/src/debugger.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa20d9cc5c9e6e425ca0552662f30113c5413a48ee7a0820b8201372bd0f788"}},{"ruleId":"D1","level":"warning","message":{"text":"ChromeLayer::new (cyclomatic 20): ChromeLayer::new has cyclomatic complexity 20 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"354da99a1f99dca622e49bf82c7e13d2177bcb0d2c47c7542dd2d76f585d2741"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::fcntl (cyclomatic 20): EvalContextExt::fcntl 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":"src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0df7ae3bd0d8c3e9655ef925ff917123799fcf59c93760c0fa7173c710999c"}},{"ruleId":"D1","level":"warning","message":{"text":"PrirodaContext::resume (cyclomatic 19): PrirodaContext::resume 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":"priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a02ed63a64252c81594f0f7d709cf004a65886d97a6233cbc6f34d276350e16"}},{"ruleId":"D1","level":"warning","message":{"text":"NewPermission::new (cyclomatic 19): NewPermission::new 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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc2e8b8477992132d33286e2051d46102e5cda0fc28ba5232d132fc89c51f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::shims::unix::linux_like::sync::futex (cyclomatic 19): miri::shims::unix::linux_like::sync::futex 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":"src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cc5ba68db6a11b671bf8ce45d0f4e1b0f94fe2ae34399f678650cdbb544c00"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse41_intrinsic (cyclomatic 18): EvalContextExt::emulate_x86_sse41_intrinsic 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":"src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ec8f0d940bee3be498142535c2624b066b2406493e7625fce0ede6859caa18"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 18): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 18 (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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8342aa4a90efeccb8ec093f50097d5f2c102521340c6ae92ea849c82fa9e73c5"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::epoll_ctl (cyclomatic 18): EvalContextExt::epoll_ctl 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":"src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"46241752f78156767f5539a60259476d4e41f620f369e24a2cec0e882e789605"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayRepr::print (cyclomatic 17): DisplayRepr::print has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b693c659adde1650016d322244c71e46efd50b3c392a8ce846b1ea3835427eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextPrivExt::tb_reborrow (cyclomatic 17): EvalContextPrivExt::tb_reborrow 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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"455d3f69d62476a5ae0f5daf9c53adc8a79c0a2be90c4d15d4431e756c9a3964"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::linux_copy_file_range (cyclomatic 17): EvalContextExt::linux_copy_file_range 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":"src/shims/unix/fs.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5939c9046bd8fd86aa83c0b3f6313380759a9a2200f1a5016048c2b81478353c"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::shims::windows::foreign_items::win_get_full_path_name (cyclomatic 17): miri::shims::windows::foreign_items::win_get_full_path_name 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e4a57533eda83d01efad0372df8d3436da6eb527deba9379d4a3ab1a14c43b"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::bench (cyclomatic 16): Command::bench 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":"miri-script/src/commands.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"978c256ce9a9e99d6f52554c4c260f2de8518d1dd8558f6e3d5228f5dcb0dfcf"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextPrivExt::sb_reborrow (cyclomatic 16): EvalContextPrivExt::sb_reborrow 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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25882eafe72dc0eac7dc8d310fe8a1b833a7ec6218bb923c42df5d27c6c47bb"}},{"ruleId":"D1","level":"warning","message":{"text":"VClockAlloc::report_data_race (cyclomatic 16): VClockAlloc::report_data_race 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":"src/concurrency/data_race.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e573197fca18b726f6592a153838ecf630d305c548bfa7f2362adb20c8b8355"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextPrivExt::schedule (cyclomatic 16): EvalContextPrivExt::schedule 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":"src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"082c16d13e299f7c8f5c9b61bb28c6de1efaf91fa04a3f61edb575d4ea62ebaa"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_bmi_intrinsic (cyclomatic 16): EvalContextExt::emulate_x86_bmi_intrinsic 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":"src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2a7c5dae3ed88c69df0d5cf71166649dd05e1c72c0ba9da465366c36b9b418"}},{"ruleId":"D1","level":"warning","message":{"text":"MiriMachine::extern_static_pointer (cyclomatic 16): MiriMachine::extern_static_pointer 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":"src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6da88f7e5d41ad86b8eed44083fdf8e4fc49b6fb52d7c7ea6060251ebd1289"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::_umtx_op (cyclomatic 16): EvalContextExt::_umtx_op 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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c24dc70637e802f6386776cf70e89d7f5793c8a7b86f85e684838664e357d55"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::set_generic_socket_option (cyclomatic 16): EvalContextExt::set_generic_socket_option 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":"src/shims/unix/socket.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52644e87583956ff643810fcafd6894633aa43f212171fc21d578f226814889"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::get_generic_socket_option (cyclomatic 16): EvalContextExt::get_generic_socket_option 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":"src/shims/unix/socket.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f2092d153143997f520e6efd830f03c24e47be3a560568b6f618a4d89b759"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::bin::miri::main (cognitive 127): miri::bin::miri::main has cognitive complexity 127 (threshold 15). Drivers by points: if/else 77 (101 pts), match/switch 4 (10 pts), loops 3 (9 pts), boolean chains 7 (nesting depth added 36). 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":"src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9450eff97830d46d863d70d37e61ffdd2ca16433f0653268ef538b40020267e9"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExtPriv::emulate_foreign_item_inner (cognitive 82): EvalContextExtPriv::emulate_foreign_item_inner has cognitive complexity 82 (threshold 15). Drivers by points: if/else 36 (68 pts), match/switch 6 (11 pts), boolean chains 3 (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":"src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85206cbae2979ce352a87a110aa6ac61ac1137399ea6625b40bde3a9ae59ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_miri::phases::phase_rustc (cognitive 75): cargo_miri::phases::phase_rustc has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (54 pts), loops 6 (13 pts), boolean chains 8 (nesting depth added 35). Of this number, 63 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. 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":"cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3074ee2bb3d92a642a91adcd5a5982841f1a41ab74c59139a685c7d0754d6b00"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::open (cognitive 66): EvalContextExt::open has cognitive complexity 66 (threshold 15). Drivers by points: if/else 41 (60 pts), boolean chains 3, match/switch 3 (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":"src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73c227fc896d3eaf03c1f856cb275b9ed050f44032f22b0805fe88e49ea0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::CreateFileW (cognitive 60): EvalContextExt::CreateFileW has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (48 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"786c1878f57d3db1a5c1006a4e53354bf0ea6c41071725f538a69553469b0b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::diagnostics::report_result (cognitive 57): miri::diagnostics::report_result has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (12 pts), match/switch 6 (12 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":"src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f7f47da8804f0c3579eaf45763d22c59428ee8b3b87f571159062504a6a27b"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::intrinsics::x86::sse42::compare_strings (cognitive 54): miri::intrinsics::x86::sse42::compare_strings has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 7 (19 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a96afc6de80832cf7faab2144ca77f997216b638ca83227e22ed17b1a2bef8"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 51): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 8 (13 pts), boolean chains 2 (nesting depth added 22). 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7264c99c5da7dffac425dcda7b48568da24b697fa7cf4d0c9f804c64d337d817"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::shims::unix::linux_like::sync::futex (cognitive 41): miri::shims::unix::linux_like::sync::futex has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c835330689ff3da7d9c5794ab25a0d21c1b939aa12824b61f955706b7ade3ece"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse42_intrinsic (cognitive 40): EvalContextExt::emulate_x86_sse42_intrinsic has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (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":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"19309582dc0159b679f24a45440e40c2ef67ef0d6cdc80ef471e3c5abcd5ebe3"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::_umtx_op (cognitive 39): EvalContextExt::_umtx_op has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 21). 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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1913b169993e95bab6438fd70042d59e5bfbf9810ba6bed0689ec89ded3644b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ChromeLayer::new (cognitive 35): ChromeLayer::new has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"23108b50066423fcd8577dc489aff73c32661d525fcaa72cf3690b02aa4efb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrirodaContext::render_source_shaped_op_inner (cognitive 34): PrirodaContext::render_source_shaped_op_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (6 pts), match/switch 3 (6 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":"priroda/src/debugger.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d833ac22914018d1efc9af4043f599672229c83873b7121f934cd5a1f23987b0"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::tb_reborrow (cognitive 34): EvalContextPrivExt::tb_reborrow has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 1 (5 pts), loops 2 (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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"261d20b9b3135f621831365e67acd1117ee2286e23bbeeec19c4c142a7316082"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_aarch64_intrinsic (cognitive 34): EvalContextExt::emulate_aarch64_intrinsic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (10 pts), match/switch 3 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e8d13d72932d3d69088237f2525ca74b88944e6b31034b56e0b7982d81cd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_miri::setup::setup (cognitive 31): cargo_miri::setup::setup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, match/switch 3, loops 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":"cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e9d1d8a5b1c33acc5748addb1953189345e1208d5cdc81118ed02a986e3da"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildListener::next (cognitive 31): ChildListener::next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (8 pts), 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":"src/shims/native_lib/trace/parent.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b547d9e075ad6f87a1744fc974055a611678cb4e3e25e64c52713fd8a8c434f1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrirodaContext::resume (cognitive 30): PrirodaContext::resume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 5, match/switch 2 (5 pts), 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":"priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ba7c748bc0caf9eec8724c576eec8856b2889123b911e26b60c96d7c26ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 28): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (7 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a783066064829cfcafae1c1fd813e0f6e0e97872cd9feec5b4d81d8572dd27"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::epoll_ctl (cognitive 28): EvalContextExt::epoll_ctl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (27 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":"src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1f1bd580e51558b6d01082790bdbbca5113b1966f6a19f4484df1fda619056"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::sb_reborrow (cognitive 26): EvalContextPrivExt::sb_reborrow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (4 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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae7e1edaa4bb28fbe206d9e304d9bf071d17c4ab3b3c7f64f135e4b5f6aa293"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_miri::phases::phase_cargo_miri (cognitive 25): cargo_miri::phases::phase_cargo_miri has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, match/switch 3 (4 pts), loops 2 (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":"cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"872b87f4429fdc0c28a8e2dc9d2604eff8e567923494aa98b8199752f567b4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::schedule (cognitive 25): EvalContextPrivExt::schedule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 1 (2 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":"src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d5bef922d420ff6f70b150963a47b0393aeff0c2155d432eb93d69211f96a6"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayRepr::print (cognitive 24): DisplayRepr::print has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 7 (8 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3965efb092941d57347ca67297e158a5579691634c6b8150d0bb8f68826414b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::set_generic_socket_option (cognitive 24): EvalContextExt::set_generic_socket_option has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (2 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":"src/shims/unix/socket.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"548878f773f0a1cd60f8fe787e3cc8064c2c2906d90a094193e1f40bdc3dc24f"}},{"ruleId":"D2","level":"warning","message":{"text":"NewPermission::new (cognitive 23): NewPermission::new has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cba6f82b69b9bf61c203501c9ab2af2a5255d58897903b8218b1ab397e0707"}},{"ruleId":"D2","level":"warning","message":{"text":"DedupRangeMap::iter_mut (cognitive 23): DedupRangeMap::iter_mut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). 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":"src/data_structures/dedup_range_map.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6181a3baf869c8adfe8b0fdee229f78ef5bfcfa1d955fdf45445fffde2c8fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_bmi_intrinsic (cognitive 23): EvalContextExt::emulate_x86_bmi_intrinsic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 2 (4 pts), boolean chains 1, match/switch 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":"src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2d84e2884a433fccf809c6589f6557bfb99b6b9b0c0a3daa179cbdbeed6420"}},{"ruleId":"D2","level":"warning","message":{"text":"MiriMachine::extern_static_pointer (cognitive 23): MiriMachine::extern_static_pointer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, 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":"src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03e43ad896a7a76bc05e6c98272edf62e688a669c09425d9fba128c2a1bf912"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::fcntl (cognitive 23): EvalContextExt::fcntl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"999944a7e548528b9412b3fb100c011266f53ec08950bd9ac44910e13ac79ced"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::bench (cognitive 22): Command::bench has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (4 pts), boolean chains 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, 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":"miri-script/src/commands.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe53adc59da870fa36caf59862c781f58b5a690ca06393f02123223d49a3d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_math_intrinsic (cognitive 22): EvalContextExt::emulate_math_intrinsic has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 5 (10 pts) (nesting depth added 9). 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":"src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3116350f7d4909253ce07a8d512426909538bc60a93a982d7bb6080e9fc279f"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_simd_intrinsic (cognitive 22): EvalContextExt::emulate_simd_intrinsic has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (6 pts), loops 3 (6 pts) (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":"src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e1499ac9fb3cc16759b3ee3f0930ab816ac485af4eacb236ee5586e03bbac4"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::host_error_to_errnum (cognitive 22): EvalContextExt::host_error_to_errnum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 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":"src/shims/io_error.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc351835e5b74a189a73dd975ff58be40dbb896e131e8783c15d41455380a19"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::diagnostics::report_msg (cognitive 22): miri::diagnostics::report_msg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), match/switch 3 (5 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":"src/diagnostics.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e395ab1397bf4f5bd445e6dccfbc98ece168a619c8771148f49da5fc8fd2c253"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::shims::windows::foreign_items::win_get_full_path_name (cognitive 22): miri::shims::windows::foreign_items::win_get_full_path_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85a4fdc2f3bf0e3a9724e96a184daeef35956b6fdde4f8b820878f7df375f39"}},{"ruleId":"D2","level":"warning","message":{"text":"Frontend::parse_from_args (cognitive 20): Frontend::parse_from_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 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":"priroda/src/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e563d4e5a32db982b8c5859c79d2959cc69d55bbd7fbf304b2c83f48307d9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::lookup_exported_symbol (cognitive 20): EvalContextExt::lookup_exported_symbol has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 11). 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":"src/shims/foreign_items.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeb89f6581d161bfc360c3675e8eaa69e623eabf2d62cee18167abcfe27b03b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileMetadata::at (cognitive 20): FileMetadata::at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 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":"src/shims/unix/fs.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"771070a103ae51a33109d8e112c98d9b5eb9ea806ed38af11034807d2724bb62"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::eval::args_to_utf16_command_string (cognitive 20): miri::eval::args_to_utf16_command_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (8 pts), match/switch 1 (4 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":"src/eval.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cacd68e274f627d7556acc1afd0dd126b26b9a5d58c9777d34e26e8f93581a"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_miri::phases::phase_runner (cognitive 19): cargo_miri::phases::phase_runner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2, 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":"cargo-miri/src/phases.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"779c54e4ca6051afc44fd06a9e95d820ccd1faf28554ffb84080547ff0380d64"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExtPriv::addr_from_alloc_id_uncached (cognitive 19): EvalContextExtPriv::addr_from_alloc_id_uncached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"src/alloc_addresses/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a39763b3ba3a1cc1dd6d355e54843558163efaba19498ac08302188e7af738"}},{"ruleId":"D2","level":"warning","message":{"text":"VClockAlloc::report_data_race (cognitive 19): VClockAlloc::report_data_race has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (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":"src/concurrency/data_race.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735b787c2dfdabf48d310bf742b573eb9dff2e7db1b5f667d10dcedf252aa59"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::convert_path (cognitive 19): EvalContextExt::convert_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 3). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (unix_to_windows, windows_to_unix). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/os_str.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e9c5da6a6c48cb6b2de04af5883f205ea3a9b17c62a16c80f8208ec811c562"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 19): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (7 pts), boolean chains 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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2e0232e799e56a6bafca264f9ed1c5d643d1d12f5981ac2844a1dd02fea381"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::get_generic_socket_option (cognitive 19): EvalContextExt::get_generic_socket_option has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (8 pts), boolean chains 1 (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":"src/shims/unix/socket.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4faea97e0d68844d0cc12149c9f7d950b89d2fac62473b317344186770f75ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::retain (cognitive 18): Stack::retain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (2 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":"src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aac099a4a86175f85b84eb73b636758534f615a74e768510c3e25960f89abc"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::try_errnum_to_io_error (cognitive 18): EvalContextExt::try_errnum_to_io_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"src/shims/io_error.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55a50bdcb5849555049373979a55137cf9a5f1b8c3392e6485af5ad3af0c203"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExtPriv::tracing_apply_accesses (cognitive 18): EvalContextExtPriv::tracing_apply_accesses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), match/switch 1 (3 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":"src/shims/native_lib/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4353f8b7c72957358ee14e0f3e067650907dad0f59105251fcc0b4446597526d"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::socket (cognitive 18): EvalContextExt::socket has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 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":"src/shims/unix/socket.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"870eaa99164c8c9bf1095973b0a4aae4224b6444cd66792c010573bd55f43f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::virtual_socket_read (cognitive 18): EvalContextPrivExt::virtual_socket_read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc12f41d63c15d9f508f83c6d547772ed4ca8e52f3dbf9c96bfc59687d08afae"}},{"ruleId":"D2","level":"warning","message":{"text":"DapSession::run_requests (cognitive 17): DapSession::run_requests has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 2 (4 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":"priroda/src/frontend/dap.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c6042e549441fc94322d3e7f3cd0a271624dd6115cbab8cb207dac2be4d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::access (cognitive 17): Stack::access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d3a5710aa2b701cbead50dc7931801eab0271734a3b3d69a824fe63e833c39"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::disable_uniques_starting_at (cognitive 17): Stack::disable_uniques_starting_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2740defcd04f406b139c15d2364f549b85a655a95e50a83e199c668d26be6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx_intrinsic (cognitive 17): EvalContextExt::emulate_x86_avx_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). 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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a8c1b46c1fe9f71c5e456f4c762268cffdc5865cdf75f228ec0bdb6616253c"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse2_intrinsic (cognitive 17): EvalContextExt::emulate_x86_sse2_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (15 pts), loops 1 (2 pts) (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":"src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bd1618e04537fa362e169c26c5324fb31d1bb4607b2535c51a97b5589830f5"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::linux_copy_file_range (cognitive 17): EvalContextExt::linux_copy_file_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. 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":"src/shims/unix/fs.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dae396035dcc46170fc9b2a2f2fd1b8e38b2c985459ef1d5a85643d8a2f9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::helpers::iter_exported_symbols (cognitive 17): miri::helpers::iter_exported_symbols has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e11e2bc1ec6b2447f15dcebb772736d625773bcf5347ef1d099e0ad0e7c0cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::math::fixed_float_value (cognitive 17): miri::math::fixed_float_value has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (6 pts), match/switch 1 (nesting depth added 2). 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":"src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d8f7ff5ad4ac41bc8ab57f7463d805292801742575d5664798748688079747"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli::print_command_result (cognitive 16): Cli::print_command_result has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (3 pts), loops 1 (3 pts) (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":"priroda/src/frontend/cli.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"81664daa74db2a0ee38ac96f747aa09e4b542995f435db9ad25205f99ae50313"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::call_llvm_intrinsic (cognitive 16): EvalContextExt::call_llvm_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b550be7c79a5cf623d54e7671f7cf93212b6abccc16097fffa74af2c3466d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse41_intrinsic (cognitive 16): EvalContextExt::emulate_x86_sse41_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 1, 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":"src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2856cdfa95d56c0e3c11c7779ca0a5b1ec771d2cd984ed8f6362b4020a090847"}},{"ruleId":"D2","level":"warning","message":{"text":"TlsDtorsState::on_stack_empty (cognitive 16): TlsDtorsState::on_stack_empty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (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":"src/shims/tls.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d96b1c03b04a5c8a0fb9db49c8c7d550ea9699f2755d3015b6211b26e2c7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::send (cognitive 16): EvalContextExt::send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 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":"src/shims/unix/socket.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62c0f3df9cad6cd5fe3d3ecfbd95c7ab9932afec97063a8fbb6ac846a54d414"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 1123 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 1023 over it, 11.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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"becfe9d467e363b8954cc22e25ff0a83170452e4b5aa04531286f3ac1acea90f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 836 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 736 over it, 8.36\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"416002ce465a95f099cd98cc91c0e27afea448259b19d5e2bc6dd53aae880941"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExtPriv.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 433 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 333 over it, 4.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":"src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"300fb3c361556a8d29ff62a5f565a678bdd84a719fb5c5d62ca83b78e995c6e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 320 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 220 over it, 3.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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1857bc78bdb83f73edda75fb4c4f9e7a9754477c8ad1990b9e75092a56491b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/fs.rs: FileTooLong \u2014 1521 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 70% of them inside a single declaration: EvalContextExt (474-2304). The bar is 500 significant lines; this is 1021 over it, 3.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":"src/shims/unix/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfc450ff39880010b6942056e25a303280120a52bd484c5197eb7819a48c75b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 1160 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), 3 methods. The bar is 400 significant lines; this is 760 over it, 2.90\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"75237c3696128737d433c06aac47d8abb0031d63bcc911e4a641ce262fc15c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 282 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 182 over it, 2.82\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":"src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ccd4dcdf8219e0f423d9f2b36897e45ef4f8e2eb9cbbc4bcc753fd8ec97964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/machine.rs: FileTooLong \u2014 1353 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 76% of them inside a single declaration: MiriMachine (4 blocks, 509-2128). The bar is 500 significant lines; this is 853 over it, 2.71\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":"src/machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe450af2425e6bfbc9d16abf4d4158eeed47ced5cb2ba4331eb014ea6512cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 1069 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), 34 methods. The bar is 400 significant lines; this is 669 over it, 2.67\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":"src/shims/unix/fs.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc2e3b51ea4706228cad16bb54bcc3401895a67306486b59ebe93b6b73c809"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MiriMachine: ClassTooLong \u2014 1033 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), 24 methods, 4 blocks, lines 509-2128. The bar is 400 significant lines; this is 633 over it, 2.58\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":"src/machine.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"931853bfe7da133646152cd6d5aadd6bdab5db985e8d622727fed8f2bbc5e87a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/foreign_items.rs: FileTooLong \u2014 1196 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 97% of them inside a single declaration: EvalContextExt (54-1546). The bar is 500 significant lines; this is 696 over it, 2.39\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528c38a8767d3984680217ec74de2eb0d6984ac1203430adc633325fb529e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: miri::bin::miri::main: FunctionTooLong \u2014 miri::bin::miri::main runs 238 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 138 over it, 2.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":"src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"35569409c87b827c6edd2e1459008317e6ee17516cecf8fe09c921dd7ed59db9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_aarch64_intrinsic: MethodTooLong \u2014 emulate_aarch64_intrinsic runs 229 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 129 over it, 2.29\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e143f33df49db0319ecc34e5910f5467535ee8204c92c07bd622be1941262b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrency/data_race.rs: FileTooLong \u2014 1108 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 608 over it, 2.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":"src/concurrency/data_race.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d440a73af4bc3b5258fc593ec83be9fc595af9f0d6be96bedc62ab174d84df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 837 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), 1 methods. The bar is 400 significant lines; this is 437 over it, 2.09\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d255423e9ea1f19676aa422223240932e20acef3608759586dbbb4fd8bb41b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MiriMachine: TooManyFields \u2014 58 stored fields beside 24 methods. The bar is 30 stored fields; this is 28 over it, 1.93\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/machine.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bcfe27ff3a4ee7e802c8222dadce961547a38645bba6beea91ba12692071a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: miri::diagnostics::report_result: FunctionTooLong \u2014 miri::diagnostics::report_result runs 193 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 93 over it, 1.93\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":"src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc68393f744da2a0970a2172b22b4b39310667c3169c3e468dfeb347c4b632"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 192 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 92 over it, 1.92\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":"src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61b6139c826134d4be53f42240ed65dd3606dfc2e7fee581d42ca64fe167d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/foreign_items.rs: FileTooLong \u2014 912 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 92% of them inside a single declaration: EvalContextExt (131-1277). The bar is 500 significant lines; this is 412 over it, 1.82\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f5f9784df1f099a7c04c53c18a03265bcdb35092881a37855da884cfd8416"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.open: MethodTooLong \u2014 open runs 182 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 82 over it, 1.82\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":"src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aedc67e53c4c27865acfa7cf99d133a41fcac028f0b8a421cc2d46d86633b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/mod.rs: FileTooLong \u2014 861 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 35 free functions. The bar is 500 significant lines; this is 361 over it, 1.72\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2cfb10c726e31b7af7fd6cb1a75dc19c12d1c9c40856383f46d59575ceaa7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 645 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. The bar is 400 significant lines; this is 245 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":"src/shims/unix/socket.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b6f349dbca6645ebb2bb9be585d6664aaceaadc712e7a3a1170e0942a1962"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/tcp_socket.rs: FileTooLong \u2014 801 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 301 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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ac40821b1362afeb15ed79b292e8f8bb020be4a5ccbfad6617e27095eca68e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_inner runs 159 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 59 over it, 1.59\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":"src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"31666cb9e9ee1f57db90fabf695a384d46d8f10b9038ea0f951673c855dccf8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextPrivExt.sb_reborrow: MethodTooLong \u2014 sb_reborrow 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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65b9f530fbd18c8f5c5007d41b6054123a3f464b5f8e96ab07ce38083aa472f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/socket.rs: FileTooLong \u2014 774 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 83% of them inside a single declaration: EvalContextExt (221-1294). The bar is 500 significant lines; this is 274 over it, 1.55\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":"src/shims/unix/socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985959b7a16ec99398979c4add26bbc032aca6bbea2d2842e6cc4015d18b8b48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MiriMachine.emit_diagnostic: MethodTooLong \u2014 emit_diagnostic 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":"src/diagnostics.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1afd1e64e08d23f20e68753eabef460edd997889453cee6f6d0af6f7f7e9fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextPrivExt.tb_reborrow: MethodTooLong \u2014 tb_reborrow runs 136 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 36 over it, 1.36\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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca819ab35b9307da511fdc74e93c7cd03912f46e4d94856dd78e38423f7fc027"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DapSession: ClassTooLong \u2014 529 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), 30 methods, 4 blocks, lines 94-820. The bar is 400 significant lines; this is 129 over it, 1.32\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":"priroda/src/frontend/dap.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5990f6c1a9787649e83bdbece91b4882c90724f625320eeb53c2cb196bc2cba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MiriMachine.new: MethodTooLong \u2014 new 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":"src/machine.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce5ad9bad104e3c9e178591e94839879351c9d52acd1192b255e5bfaec61db3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PrirodaContext: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"priroda/src/debugger.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"581650d1ae7bb3cc2a5ebaedadce2e20a45d547f51da8529f3a6c750e786eb14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MiriConfig: TooManyFields \u2014 38 stored fields. 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":"src/eval.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da4e5e0ef67266520906369f2e152df9271f6b03c9f1fce786a21c811c834d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_sse2_intrinsic: MethodTooLong \u2014 emulate_x86_sse2_intrinsic runs 124 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 24 over it, 1.24\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":"src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93ef06cb2afc4380e955b338ff1f29e8512a972e4ac71d627ea90bffc0c10da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/sync.rs: FileTooLong \u2014 619 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 119 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":"src/shims/unix/sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c552274bda66f628ce452617d4aff8071cfeeb0a6483fd1d8679aadba47b53fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shims/foreign_items.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), about 73% of them inside a single declaration: EvalContextExtPriv (257-954). The bar is 500 significant lines; this is 114 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":"src/shims/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ebb412abd61aaf071b3c6f2921039d2cd391c95e695c79a727bf4debeb3633"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrency/thread.rs: FileTooLong \u2014 612 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 112 over it, 1.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":"src/concurrency/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e91004d35627b9cf255163a70633502f5396f02d5333ce692efa1adfdfd2dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 610 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 110 over it, 1.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":"src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0160be61a5b25a45178badad16d6c14a2ea27b6d154327a6015e14d4f075907"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/helpers.rs: FileTooLong \u2014 603 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: EvalContextExt (169-969). The bar is 500 significant lines; this is 103 over it, 1.21\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":"src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93416fae2584564c25c109f12e81f8e73f3f40a7f64c165fe926f5905cb9f5ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_borrows/tree.rs: FileTooLong \u2014 598 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 98 over it, 1.20\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":"src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfb58828bcfff47b7aa2bf3a0ed8fd67aa81625a884d86912d27592d70efcc5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TcpSocket: ClassTooLong \u2014 476 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), 1 methods, 6 blocks, lines 88-1533. The bar is 400 significant lines; this is 76 over it, 1.19\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ed071577cef051c8d60c8b0f5eaeffd690e64823ba832421d9ac2b5d9bcc7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frontend/dap.rs: FileTooLong \u2014 593 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: DapSession (4 blocks, 94-820). The bar is 500 significant lines; this is 93 over it, 1.19\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":"priroda/src/frontend/dap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328ddecb0e7d55902f99e5269b23a849186148c1bcfc256c88045b62271472d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_miri::phases::phase_rustc: FunctionTooLong \u2014 cargo_miri::phases::phase_rustc 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":"cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b84bfcf4484cdb1f7bffc984a45beb1b0e900f6675f8904b0eb183b27e642"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisplayRepr.print: MethodTooLong \u2014 print runs 116 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 16 over it, 1.16\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":"src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"85905629d26e528340305ed172dd470b9f9352db0e5ac09232c67dfe4f84a82c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.CreateFileW: MethodTooLong \u2014 CreateFileW runs 116 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 16 over it, 1.16\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":"src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f959f6c063672defb150e97b943b44170b12f10bf38ffbd4535e76f5f1ae92e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.linux_statx: MethodTooLong \u2014 linux_statx runs 115 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 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/fs.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1d096458f2dbe8d7a3c8cbb3edf07697d6b88a9737dfebd6308197f8f00bec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenmcCtx: TooManyMethods \u2014 34 methods, declared across 4 files: genmc/mod.rs (29), genmc/run.rs (3), genmc/scheduling.rs (1), genmc/shims.rs (1). The bar is 30 methods; this is 4 over it, 1.13\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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9194c0af6774d8c8c92d250edb5183740978f96b63e46a47f1e6b9a4049144e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 453 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), 45 methods. The bar is 400 significant lines; this is 53 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":"src/helpers.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2cc020f9dad639449d7f4411d2387560fa0467e05333a7e72dedb66f2c5432"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenmcCtx: ClassTooLong \u2014 452 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), 34 methods, 5 blocks, lines 110-815. The bar is 400 significant lines; this is 52 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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b619deab5a63e9119caad9befbd16ab120737b0acc54227aa4b55a3576c813"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_avx512_intrinsic: MethodTooLong \u2014 emulate_x86_avx512_intrinsic 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":"src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb1ddc3b719659f49097ff4731e32a55cd910eed7181c0a1925810fa57c0c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_foreign_item_inner: MethodTooLong \u2014 emulate_foreign_item_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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"22181602f874639d12ad1e14ccd4707fb303b663e1bb8dc2cab06d5da41cd895"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 448 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. The bar is 400 significant lines; this is 48 over it, 1.12\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":"src/shims/windows/fs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"07111929f4ed373b790baa3cd3f35879d5728b5b795c99229678f075ad86225e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExtPriv: ClassTooLong \u2014 448 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), 2 methods. The bar is 400 significant lines; this is 48 over it, 1.12\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":"src/shims/foreign_items.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36ed2d0e97d1e3a4146fca1a6169c04fe42c841b0ca6a3247836c3978df8c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stacked_borrows/mod.rs: FileTooLong \u2014 556 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 56 over it, 1.11\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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4a5cd23c5a1ef34245d7efb13357375cbbf6f712e09f412e183991a000783e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_avx2_intrinsic: MethodTooLong \u2014 emulate_x86_avx2_intrinsic 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":"src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70c30840ba2d44f1e98a78f649aa19a83788553463c6a6ae8bc08c2c46347a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: miri::shims::unix::linux_like::sync::futex: FunctionTooLong \u2014 miri::shims::unix::linux_like::sync::futex 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":"src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb29586e09a9691f7d4fa12597d1d147ebe0a80204a351fa262aa3a0a88b3934"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/fs.rs: FileTooLong \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), about 83% of them inside a single declaration: EvalContextExt (108-825). The bar is 500 significant lines; this is 40 over it, 1.08\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":"src/shims/windows/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2216a09d3955c8169c3b908a277769cc6080022476b01ff4f15cba5c67d9a016"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_avx_intrinsic: MethodTooLong \u2014 emulate_x86_avx_intrinsic 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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bae586f762552bc89483f0e8c38edc06468f0033338b9d568a478d68cf5777d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_miri::setup::setup: FunctionTooLong \u2014 cargo_miri::setup::setup 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":"cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"19223be70a6483ed4488870bac9546c37942299d052cf06bfd0412ddf7f38a41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_sse42_intrinsic: MethodTooLong \u2014 emulate_x86_sse42_intrinsic 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":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbae100ddd97e18254cfb050ed5c8dd8ff7b3006630ef400bc8620e657b29391"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt._umtx_op: MethodTooLong \u2014 _umtx_op 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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd39bb524c10d1372f51733445d4582259480bb8a3a4abd50211d6b3c0154348"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_miri::phases::phase_cargo_miri: FunctionTooLong \u2014 cargo_miri::phases::phase_cargo_miri 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":"cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"163480b43a6a4f891cc48d4bb5cb9040b484ccbcb8afb3c1def0c880b54d2837"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PrirodaContext: ClassTooLong \u2014 415 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), 39 methods, 2 blocks, lines 38-991. The bar is 400 significant lines; this is 15 over it, 1.04\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":"priroda/src/debugger.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfaebe58e852cc55cb227558f17a3816740eabd690c729d2a775125f0681897"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/debugger.rs: FileTooLong \u2014 513 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 81% of them inside a single declaration: PrirodaContext (2 blocks, 38-991). The bar is 500 significant lines; this is 13 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":"priroda/src/debugger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0ca62281e02210b9cd5b9f130eb652eeb7332a7536ad823ac28daf449893c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: genmc/mod.rs: FileTooLong \u2014 507 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: GenmcCtx (5 blocks, 110-815). The bar is 500 significant lines; this is 7 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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ba3269c4d7e5a9688a4c7ee667685a7f5e288d01be4ad0603e708e83eecb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): priroda/src/frontend/dap.rs:488-531 | priroda/src/frontend/dap.rs:537-576 \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce9257bc2cc8fa05192a8c6788b204b216eb07a62b691e5067e7e235806a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): src/intrinsics/aarch64.rs:14-415 | src/intrinsics/x86/avx.rs:17-243 | src/intrinsics/x86/avx512.rs:233-266 | src/intrinsics/x86/gfni.rs:12-64 | src/intrinsics/x86/gfni.rs:78-127 | src/intrinsics/x86/mod.rs:306-326 | src/intrinsics/x86/mod.rs:336-354 | src/intrinsics/x86/mod.rs:515-557 | src/intrinsics/x86/mod.rs:581-603 | src/intrinsics/x86/mod.rs:864-896 | src/intrinsics/x86/mod.rs:910-943 | src/intrinsics/x86/mod.rs:1024-1056 | src/intrinsics/x86/mod.rs:1171-1199 | src/intrinsics/x86/mod.rs:1220-1249 | src/intrinsics/x86/mod.rs:1263-1287 | src/intrinsics/x86/mod.rs:1361-1387 | src/intrinsics/x86/mod.rs:1519-1539 | src/intrinsics/x86/sse41.rs:13-161 \u2014 These 18 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 18 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 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/aarch64.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"47733281614a2a36a54fcbedc41fd8c0b135225dd60346ea47127913893bba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/intrinsics/x86/mod.rs:790-811 | src/intrinsics/x86/mod.rs:821-844 | src/intrinsics/x86/mod.rs:1171-1199 | src/intrinsics/x86/mod.rs:1220-1249 \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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0424c77cbd3134d163fe51cc9bdf541e66b4f2c895a5cd55ecc162afdf6d3aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/shims/unix/freebsd/foreign_items.rs:21-184 | src/shims/unix/linux/foreign_items.rs:41-401 | src/shims/unix/macos/foreign_items.rs:29-457 | src/shims/unix/solarish/foreign_items.rs:24-235 \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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b2e3f21e43a7fd0f1a486d49df48c33446ec00915078b90c8859c5ff433333"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/shims/unix/fs.rs:885-929 | src/shims/unix/linux_like/epoll.rs:88-200 | src/shims/unix/socket.rs:715-747 | src/shims/unix/socket.rs:756-829 \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":"src/shims/unix/fs.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"900ba69854aec1f858ac7b833526d111e8692162bee1cb82ca71514480719408"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/shims/unix/fs.rs:1779-1792 | src/shims/unix/fs.rs:1794-1810 | src/shims/unix/fs.rs:1818-1837 | src/shims/unix/fs.rs:1910-1940 \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":"src/shims/unix/fs.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"612d1ce4c8a5734838601e2f75f734d5ceca13738ce21cf4ca55b878b2616178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): src/shims/unix/virtual_socket.rs:542-639 | src/shims/unix/virtual_socket.rs:645-718 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"041ec9070e8ba911756c0dacfde7fb924ea3a699561e4c2931b57f6318f69f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): src/shims/windows/fs.rs:581-672 | src/shims/windows/fs.rs:686-772 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/fs.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a00dc5f49a7383e5eb741b964835190a3f856d8e4b2a71ea495c5df75f61126"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): src/shims/unix/fd.rs:481-577 | src/shims/unix/fd.rs:589-672 \u2014 These two members are one piece of code written twice and then edited apart: 84 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/fd.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe534420ba84be985637bad3b2a2ad1f41920d939cede3ff6e9623d49ebbd12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): src/shims/unix/virtual_socket.rs:341-420 | src/shims/unix/virtual_socket.rs:434-529 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd6bb0a424cadcc745c766350434421193e8aa28760c5e60b2d8533cf08ec66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): src/shims/unix/tcp_socket.rs:1128-1199 | src/shims/unix/tcp_socket.rs:1263-1340 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f0066b32cddec9d1fd6eb2b6dd04a8e63760a7bd5eab136bea27b5201b517"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/intrinsics/x86/mod.rs:1069-1102 | src/intrinsics/x86/mod.rs:1117-1148 \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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fa3b7d1ddfafc90aba67d0b8cb8124b6b2ca96e4497b0fc9d7ac5b58e2d4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/shims/unix/fd.rs:377-419 | src/shims/unix/fd.rs:428-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":"src/shims/unix/fd.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e23b3e77874097fa5160515a185201f86d28a0429e3023629cf758ddabf0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/shims/unix/tcp_socket.rs:607-644 | src/shims/unix/tcp_socket.rs:655-701 \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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b2ad36603af9d0233da6dd29712e5f1bc393ebbf2bf9a1dcb3e3c72788acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/shims/unix/fd.rs:690-725 | src/shims/unix/fd.rs:740-779 \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":"src/shims/unix/fd.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc25899a64c992e99905520109ee2d01e84831056aaabb2f3330e3aa71f611fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/machine.rs:1695-1726 | src/machine.rs:1736-1776 \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":"src/machine.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be7fef50105a2154861f72ea8de36acd6046e3d25004f310129231e4728e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): src/shims/unix/tcp_socket.rs:976-1009 | src/shims/unix/tcp_socket.rs:1083-1117 | src/shims/unix/tcp_socket.rs:1216-1251 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ce9997af311fa7a993d3a915eca083edd1962711754b972d030b3183e6f311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/shims/unix/socket.rs:458-490 | src/shims/unix/socket.rs:868-909 \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":"src/shims/unix/socket.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38e3fd1895048682b9e83027ee6c538f075e4d9058d08e9fc20e5264cd2b271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/concurrency/weak_memory.rs:504-536 | src/concurrency/weak_memory.rs:608-642 \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":"src/concurrency/weak_memory.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd0e572b30f5f32f66e609c3c2cde72acdb19000f4e3c0e5cc0402bf4a10be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/shims/unix/fs.rs:1234-1264 | src/shims/unix/fs.rs:1266-1297 \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":"src/shims/unix/fs.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"390cbd7e7aaf63ffea270686b48c754b8275b5f6a7f496f7c5a024012f82ce77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/shims/unix/fs.rs:931-956 | src/shims/unix/fs.rs:959-984 | src/shims/unix/fs.rs:986-1010 \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":"src/shims/unix/fs.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d3eab3157a97980c6963564cd20f7fbef4e76c140584ee07e29a3c5ec30402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/shims/io_error.rs:358-393 | src/shims/io_error.rs:402-437 \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":"src/shims/io_error.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1222311cb6489731a6fbcf7edde1efb8dafd6d9f7540b6c740bf6e6331bb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/concurrency/data_race.rs:1222-1253 | src/concurrency/data_race.rs:1267-1297 \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":"src/concurrency/data_race.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c703936d9b70919f6602ac97cb158841f2ec4dd7699b6cefe79054e2ef139f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/shims/unix/fs.rs:810-837 | src/shims/unix/fs.rs:1361-1389 \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":"src/shims/unix/fs.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"150b1eeee66b97eeb2b3028b44000f197df2eb078e892b7ca538531de416475b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/shims/unix/env.rs:144-170 | src/shims/unix/env.rs:172-194 \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":"src/shims/unix/env.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"447f12ad620c78f9e2ab6148931f879781796844fb2dafa4b77affd1bda2c38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/shims/unix/tcp_socket.rs:270-307 | src/shims/unix/udp_socket.rs:158-193 \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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21ea5907e97199c5ddd808c4e7a9736c4c5a5e165bcb40537ccbd03ed750ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/shims/unix/mem.rs:144-174 | src/shims/unix/mem.rs:181-218 \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":"src/shims/unix/mem.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c90e1f1e0e9e2a6b5f0ae3a1c02149d91395aa0c8930f0f62271a6ac641081"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/shims/unix/socket.rs:316-338 | src/shims/unix/socket.rs:340-359 \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":"src/shims/unix/socket.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9791d2ec52ac9df1492379bd281d85437e9e1958a10fda160d1ac0947aa8ceb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/shims/time.rs:460-482 | src/shims/time.rs:487-506 \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":"src/shims/time.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"71817b546fa898a0fb92f46916b85c29cb9f3aa58678097ee449ea7d059d8202"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/shims/unix/macos/sync.rs:386-414 | src/shims/unix/macos/sync.rs:438-464 \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":"src/shims/unix/macos/sync.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b807cdb3a1ba44e262eb3d590087bb4e125d71c3589ad2e4b373e12446fd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/concurrency/sync.rs:323-352 | src/concurrency/sync.rs:415-439 | src/concurrency/sync.rs:502-526 \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":"src/concurrency/sync.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b59d9d5620921ae96f3035cf2ff90381c0eb2033cab29104d3f4d245c3624f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/borrow_tracker/tree_borrows/wildcard.rs:195-221 | src/borrow_tracker/tree_borrows/wildcard.rs:225-244 \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":"src/borrow_tracker/tree_borrows/wildcard.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa2934e517f379997327ffde253c648655b17ba15b61910aaf23559662e2368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/intrinsics/math.rs:48-64 | src/intrinsics/math.rs:72-88 \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":"src/intrinsics/math.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a97187a4f129ffa524ad05d43bd724d33d39b50b19dc2bc15e7148d6d6418dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/concurrency/genmc/mod.rs:648-673 | src/concurrency/genmc/mod.rs:709-734 \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a7ba8e8ae6bfbf76cf5a940ccbb2fa883400cd92434a7e3e305c5b93901b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/shims/os_str.rs:144-153 | src/shims/os_str.rs:160-169 \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":"src/shims/os_str.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"048aab44aaaf35ad12bb8e961ae3cc8fe784500e7b67267e84eb77322b78546c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/shims/time.rs:324-348 | src/shims/time.rs:350-375 | src/shims/time.rs:433-455 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"src/shims/time.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a244fdf62b857b681714197e773a4d6b751dc08a52bef52984992f3c31741c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/shims/unix/fs.rs:82-101 | src/shims/unix/fs.rs:111-130 \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":"src/shims/unix/fs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a0e66bbc7c4384b2b614081f8fae713d8886bb8b131c0f0a8ddc2c7f86dbe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/shims/unix/socket.rs:1248-1266 | src/shims/unix/socket.rs:1275-1293 \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":"src/shims/unix/socket.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e76b8111fc80570f7c579886bdb5d14b99f792f2be6f3dcd8a15cdb7d19e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/concurrency/vector_clock.rs:315-345 | src/concurrency/vector_clock.rs:369-399 \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":"src/concurrency/vector_clock.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd936118ef3bef5d61daf1b6cc1bfc1f2220719326e44dea0a6976320cb5b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/shims/native_lib/trace/parent.rs:573-596 | src/shims/native_lib/trace/parent.rs:601-614 \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":"src/shims/native_lib/trace/parent.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e90d1b07c9749f1f9591fbc2162beeeda82f6e6f65ed6fcb5f4da6f48b6b32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/shims/unix/socket.rs:1074-1091 | src/shims/unix/socket.rs:1104-1121 \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":"src/shims/unix/socket.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd109cb9fee61b803fa863a79ffe63afec593c6a861ae5635c75ea9e7d6aee0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/shims/panic.rs:11-27 | src/shims/panic.rs:30-46 \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":"src/shims/panic.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864d5fabccf61ee9a3d97dc5a8f666551695b8448de61bf89713985b5f59ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/concurrency/init_once.rs:90-114 | src/concurrency/init_once.rs:117-138 \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":"src/concurrency/init_once.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e07920a9894cda71f541c4777902b95c9cbc82c16a257f1886f2b63f58e6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/shims/unix/thread.rs:45-66 | src/shims/unix/thread.rs:68-81 \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":"src/shims/unix/thread.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ad18a2f316f6c271d0177358e0391e683f0eef01e645911c3f8cebabbeb8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/shims/unix/sync.rs:222-246 | src/shims/unix/sync.rs:336-364 \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":"src/shims/unix/sync.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9d8668c54a034de63b54853153fa6e60c4d9456b0d50789e619347bb90cdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/shims/unix/fs.rs:1670-1684 | src/shims/unix/fs.rs:1692-1714 \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":"src/shims/unix/fs.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"baced83dbe3458b503e8c3a4cf12c88e25a2c7737a72e6a622e2c25eaf728bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/shims/unix/sync.rs:423-436 | src/shims/unix/sync.rs:700-713 \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":"src/shims/unix/sync.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffb34d4fbffa0fbcd3486080bb8e32d33463569169cad4ddaba720b4b254a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/shims/windows/sync.rs:265-280 | src/shims/windows/sync.rs:281-296 \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":"src/shims/windows/sync.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e28048e1b60677780012e3961a11fe6a901d8ece049da2f15a7894780282a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/shims/files.rs:493-509 | src/shims/files.rs:518-532 \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":"src/shims/files.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d48ba15c8b6d4bfcadf1b551a4f53789f2dbb3e70ca530a7567920e68b0a4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/shims/time.rs:238-253 | src/shims/time.rs:294-307 \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":"src/shims/time.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d60d60ac49e114dd28d272a310118fae33cb0bf096b4da8f379b0150fe15d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/borrow_tracker/stacked_borrows/mod.rs:536-548 | src/borrow_tracker/stacked_borrows/mod.rs:557-569 | src/borrow_tracker/stacked_borrows/mod.rs:578-586 \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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9fdfcad3ebe2d64b84e93fa52435ddc9a05d6c705d730848d25a285583d109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/concurrency/vector_clock.rs:347-367 | src/concurrency/vector_clock.rs:401-421 \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":"src/concurrency/vector_clock.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfa9ec161aa0315bc981b23feba5ff3019dcc66e14cdc358b2575f766431682"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/shims/unix/macos/sync.rs:331-358 | src/shims/unix/macos/sync.rs:416-436 \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":"src/shims/unix/macos/sync.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb2653a30c8a00a6291c737bd9591975d4f867ef6c55d825ea3aead7c42dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/intrinsics/aarch64.rs:440-447 | src/intrinsics/x86/sha.rs:131-139 \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":"src/intrinsics/aarch64.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb37fc887bb756e7d306cedec3dd5c147371048057d7ae57063a4e9f614946c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/concurrency/data_race.rs:1492-1506 | src/concurrency/data_race.rs:1514-1528 \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":"src/concurrency/data_race.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b06614f7d96929cbe66370711cd0839d3a493e9cb6698d74856c47e0171b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/concurrency/genmc/mod.rs:436-453 | src/concurrency/genmc/mod.rs:463-480 \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f534d6aaeaa06ac71901adea2a3d318db4aa8ee1e7ad39b1b0f8fa27983a9e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/concurrency/sync.rs:356-366 | src/concurrency/sync.rs:443-453 \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":"src/concurrency/sync.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eb380709b9d2c2a46cff180f3d573d841f04a17413367d718833233ac84b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/borrow_tracker/mod.rs:442-456 | src/borrow_tracker/mod.rs:464-478 | src/borrow_tracker/mod.rs:486-495 \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":"src/borrow_tracker/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3a891f0839f88244547b8ee03c8bd2c907fc47b83da8cb9bb9f3a19a24dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/concurrency/genmc/mod.rs:533-551 | src/concurrency/genmc/mod.rs:681-697 | src/concurrency/genmc/mod.rs:742-756 \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce046425bec9a47d12430fa7c17355bc872a9212ab7c25f9ca090189b6f1d323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/shims/unix/sync.rs:447-461 | src/shims/unix/sync.rs:743-758 \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":"src/shims/unix/sync.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba03b136b50e42938d1e3c8ad07ebb12496163d39250429cfbc503b4dfce533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/data_structures/dedup_range_map.rs:40-56 | src/data_structures/range_object_map.rs:44-58 \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":"src/data_structures/dedup_range_map.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06b472a6473a172eb2440b0b70510d260887d6288f349f9ca1d043a7cd73a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/shims/unix/linux_like/eventfd.rs:57-69 | src/shims/unix/linux_like/eventfd.rs:90-103 \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":"src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2aae5aff7a49d69e1823666178b9294e69d05666891d0885fb017dbc1780f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/shims/unix/udp_socket.rs:223-240 | src/shims/unix/udp_socket.rs:247-259 \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":"src/shims/unix/udp_socket.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0472e4f5e056abc2309161983bbb81cd148fb01444930317641718b3092ece4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/concurrency/data_race.rs:660-666 | src/concurrency/data_race.rs:675-685 \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":"src/concurrency/data_race.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"0251f82c48da528e6fee0de87fdbbd8981ca3b6570512e115c0891d687f8e0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/shims/unix/sync.rs:578-595 | src/shims/unix/sync.rs:597-608 | src/shims/unix/sync.rs:614-643 | src/shims/unix/sync.rs:645-656 \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":"src/shims/unix/sync.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba79457d3bfdcc86a68d9eb9197757c1ef263d1fc602e19a0603cf9b732ad211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/concurrency/data_race.rs:562-568 | src/concurrency/data_race.rs:579-585 \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":"src/concurrency/data_race.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f00c61e9bcfa3aa50cbcb83b0d7def03a9b549b64e25449abd5147e4f2d5c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src/intrinsics/x86/mod.rs:1445-1451 | src/intrinsics/x86/mod.rs:1464-1470 | src/intrinsics/x86/mod.rs:1483-1489 | src/intrinsics/x86/mod.rs:1502-1508 \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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e43df917b177fa0fcf57fcbae752199d7497459cdd64d51bae737e398dc040"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): src/shims/unix/sync.rs:555-572 | src/shims/unix/sync.rs:672-689 | src/shims/unix/sync.rs:841-857 | src/shims/unix/sync.rs:964-979 \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":"src/shims/unix/sync.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1773671c82af44906c3a42ae315ccd1f0313ffa6152dff887d4ecc3212a22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/concurrency/data_race.rs:982-993 | src/concurrency/data_race.rs:997-1009 \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":"src/concurrency/data_race.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"200c93d60a45aa7d6dc84a9d9e9680043c6b451f95f4a87c0c7f46403ee74f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): cargo-miri/src/util.rs:126-129 | miri-script/src/util.rs:24-27 \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":"cargo-miri/src/util.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a814d4b0c5bbd11952790a45eb525a23ee987a8aa1656bfdab857476c5a3732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:70-100 | src/shims/unix/linux/foreign_items.rs:196-226 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.rs:70\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8b1a3eb12dede8ec3c66dac93a92886b6455ae476f8488d46dce257207c019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/shims/unix/fd.rs:493-522 | src/shims/unix/fd.rs:600-629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fd.rs:493\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":"src/shims/unix/fd.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f26b78cc393726aad38adcda37e5e82b70b780bfecceccd3f65688083d6b42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): src/shims/unix/fd.rs:691-715 | src/shims/unix/fd.rs:741-769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fd.rs:691\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":"src/shims/unix/fd.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3b3bc932e7de40013e79236e25d46f87dabeeed2443381545d8b4962637047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/shims/windows/fs.rs:639-667 | src/shims/windows/fs.rs:739-767 \u2014 both copies are in the same file, so extract the block 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, \u0060src/shims/windows/fs.rs:732\u0060 calls \u0060File\u0060, \u0060invalid_handle\u0060, \u0060Some\u0060 and \u0060src/shims/windows/fs.rs:634\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":"src/shims/windows/fs.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a050b898d97e97ecaf4e06a2e0bf00df04e0fd4749065a024cd4c114802417c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/shims/windows/foreign_items.rs:235-260 | src/shims/windows/foreign_items.rs:275-300 \u2014 both copies are in the same file, so extract the block 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5923543cf63887f647ea82ff19ad458c37687f1fda7519377abe17b1b0aae09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/intrinsics/x86/mod.rs:483-507 | src/intrinsics/x86/mod.rs:533-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/mod.rs:483\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, \u0060src/intrinsics/x86/mod.rs:530\u0060 calls \u0060try_from\u0060, \u0060to_uint\u0060, \u0060unwrap_or\u0060 and \u0060src/intrinsics/x86/mod.rs:480\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cc51386329ee7dbbaa64cf5ee823c190d3d559d86ad4ec0869db6cd82ce1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/shims/unix/virtual_socket.rs:615-639 | src/shims/unix/virtual_socket.rs:694-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/virtual_socket.rs:615\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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b84616b26553427e91902fd83cbf62e603e2369cd9e9e8090b3fb53104f072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): priroda/src/frontend/dap.rs:368-390 | priroda/src/frontend/dap.rs:509-531 | priroda/src/frontend/dap.rs:554-576 \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 \u0060priroda/src/frontend/dap.rs:368\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":"priroda/src/frontend/dap.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd4dd748c9f83fb19afccbe5b3a3a4b526b1bcd459b59e61380cea7f4541983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/shims/unix/socket.rs:242-262 | src/shims/unix/socket.rs:389-409 | src/shims/unix/virtual_socket.rs:551-570 \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":"src/shims/unix/socket.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cd32869c897b337f78691e291e4069c93d38ec2fe1acc35595b677fd856cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): src/intrinsics/aarch64.rs:273-286 | src/intrinsics/loongarch.rs:44-63 \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 \u0060src/intrinsics/aarch64.rs:273\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206593ee20d79d873ffffcdaff3da54f34797cf31f85e226a1108648001fb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): src/shims/unix/freebsd/sync.rs:197-215 | src/shims/unix/linux_like/sync.rs:222-235 \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 \u0060src/shims/unix/freebsd/sync.rs:197\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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e298703e2c72de7d1c2fc646d0cf0627d221e228bce0350ea109a53438a7a086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201318 lines \u00D7 3): src/shims/unix/freebsd/foreign_items.rs:42-53 | src/shims/unix/macos/foreign_items.rs:263-280 | src/shims/unix/solarish/foreign_items.rs:83-92 \u2014 \u0060src/shims/unix/macos/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.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 3 separate duplicated blocks between them, totalling at least 35 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 \u0060src/shims/unix/freebsd/foreign_items.rs:42\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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9b3d1267cc4c815686dfefbe9c093123d7ad347a0bda619f2c3e6c4c4aa592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/shims/unix/tcp_socket.rs:239-255 | src/shims/unix/udp_socket.rs:127-143 \u2014 before extracting anything, compare \u0060src/shims/unix/tcp_socket.rs\u0060 and \u0060src/shims/unix/udp_socket.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"628a344a438c3851b7b4042c4483656f26e8deb1682ded57a9312268dbb6c6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/shims/unix/tcp_socket.rs:763-779 | src/shims/unix/udp_socket.rs:268-284 \u2014 before extracting anything, compare \u0060src/shims/unix/tcp_socket.rs\u0060 and \u0060src/shims/unix/udp_socket.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/shims/unix/tcp_socket.rs:761\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/shims/unix/udp_socket.rs:266\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"599ccec0aed388577cc1fdc4ef964c2a42f3f8e91344dd5aa5eb30c1887bdf97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/shims/unix/tcp_socket.rs:1164-1180 | src/shims/unix/tcp_socket.rs:1305-1321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/tcp_socket.rs:1164\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c615464b12ec48665d9461f5f5910ce8c9c903f1a532f6c60d8331de0d5633c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/shims/math.rs:231-246 | src/shims/math.rs:253-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/math.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/math.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c678fa6b34aa9ad2a0828e58c2648e19a3b292babb35ed64c7cbe290adf7b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/shims/math.rs:66-80 | src/shims/math.rs:159-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/math.rs:66\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":"src/shims/math.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0872552a34360fe2735e13edd94b1cc580d38ba67aa55facdc92d2cd96f0634b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/shims/unix/socket.rs:382-396 | src/shims/unix/socket.rs:536-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:382\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":"src/shims/unix/socket.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f70f4e30a1aa3344cb016ef52659a9e7aab3491534927c8ac4d36f97716b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/intrinsics/x86/avx.rs:135-147 | src/intrinsics/x86/avx.rs:165-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 \u0060src/intrinsics/x86/avx.rs:135\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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"323eedca7c23517b4cbcfb9b265a86ba5bcfeb235f504f33503af8cb86beb979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/shims/math.rs:103-116 | src/shims/math.rs:195-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 \u0060src/shims/math.rs:103\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":"src/shims/math.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3135067051a63e3ba7ce4ec83949236095669550b369c2aa6f8b99c6f65db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/shims/time.rs:335-348 | src/shims/time.rs:363-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/time.rs:335\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":"src/shims/time.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a8e7f5d8846d9973067719916f1068c782edfc60937512b7f5db3ae1f7f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/shims/unix/foreign_items.rs:896-909 | src/shims/windows/foreign_items.rs:642-655 \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 \u0060src/shims/windows/foreign_items.rs:642\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, \u0060src/shims/unix/foreign_items.rs:895\u0060 calls \u0060deref_pointer\u0060, \u0060read_pointer\u0060 and \u0060src/shims/windows/foreign_items.rs:642\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"da94ce93877fa497507389a3a4c39ea9276d1f499379ab22146e11b74687fec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/shims/foreign_items.rs:765-777 | src/shims/foreign_items.rs:792-804 | src/shims/foreign_items.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/shims/foreign_items.rs:790\u0060 calls \u0060check_target_os\u0060 and \u0060src/shims/foreign_items.rs:764\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":"src/shims/foreign_items.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"27070ef4a2514f4cd6a9ee595b34fd9c8cc0d5ca8e2e396ab75df7551bfede9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/concurrency/weak_memory.rs:505-517 | src/concurrency/weak_memory.rs:609-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/concurrency/weak_memory.rs:505\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, \u0060src/concurrency/weak_memory.rs:519\u0060 calls \u0060sc_read\u0060 and \u0060src/concurrency/weak_memory.rs:623\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":"src/concurrency/weak_memory.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aca932fc3914b47fe5817a49fee36815d95d904ab76ecf03bfa6b1a5da4f9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/intrinsics/x86/avx2.rs:182-194 | src/intrinsics/x86/sse2.rs:56-68 \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":"src/intrinsics/x86/avx2.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"04653ac8902aa2e2dd34a5cc630f956780af968a2435cd0b99466f2b414eac9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/shims/unix/linux/foreign_items.rs:223-235 | src/shims/unix/solarish/foreign_items.rs:55-67 \u2014 \u0060src/shims/unix/linux/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.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 5 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/linux/foreign_items.rs:223\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":"src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e6434797849d621a4acffc3f437632aa12623666edee81348f6e9a8324d043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/shims/unix/macos/sync.rs:402-414 | src/shims/unix/macos/sync.rs:452-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/macos/sync.rs:402\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":"src/shims/unix/macos/sync.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f5e346abb666f8895a6653faaa6707e6e90d75134371b78dafe68c11c17ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/shims/unix/sync.rs:223-235 | src/shims/unix/sync.rs:337-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/sync.rs:223\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":"src/shims/unix/sync.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"92962b1d138a89d2b2fc5feaa4dad41f1c85f1bbfd4e7ab0ef635b73dbc29eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/concurrency/sync.rs:421-432 | src/concurrency/sync.rs:508-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/concurrency/sync.rs:421\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/sync.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ddffac7fd78427cf125f626e060d0f23c4909a2800c3c4bf906b96b862ac1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/intrinsics/x86/mod.rs:1070-1081 | src/intrinsics/x86/mod.rs:1118-1129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/mod.rs:1070\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2061bba7edf432bf5976be8e906101c744196dec43d269a8483772377af8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/shims/unix/freebsd/sync.rs:157-171 | src/shims/unix/linux_like/sync.rs:168-179 \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 \u0060src/shims/unix/freebsd/sync.rs:157\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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c233916f3ca20181cc05717afed1897586bd8e6af74e7e90a06c1fbf97366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/shims/unix/socket.rs:956-967 | src/shims/unix/socket.rs:1132-1143 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/socket.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb86c4c84375f9b108a3a21cc3cb586d0dc8e66ba6e6ccc384f17166769c6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/shims/unix/virtual_socket.rs:371-382 | src/shims/unix/virtual_socket.rs:462-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/virtual_socket.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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cd95c7661eebc19f364f684d3d75cfe8ffb51eb9de596efc0b3f463ad7fdc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/shims/time.rs:335-345 | src/shims/time.rs:363-373 | src/shims/time.rs:443-453 \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":"src/shims/time.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed48841baa376680a1d85e3cfe214df750ebdfbc585e281ebb89e030327e0a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/shims/cpu_affinity.rs:113-123 | src/shims/cpu_affinity.rs:168-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 \u0060src/shims/cpu_affinity.rs:113\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, \u0060src/shims/cpu_affinity.rs:129\u0060 calls \u0060chunk_size\u0060 and \u0060src/shims/cpu_affinity.rs:183\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":"src/shims/cpu_affinity.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53501cf18caa9787d605f4dcefc17a60246089f1067862a74e8df36ab507541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/shims/unix/socket.rs:341-351 | src/shims/unix/socket.rs:912-922 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:341\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":"src/shims/unix/socket.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0743273dd461a7d58ca9c54e147b89e18b12cb077acd360eb33a39c0038da75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/shims/windows/foreign_items.rs:612-623 | src/shims/windows/foreign_items.rs:669-680 \u2014 both copies are in the same file, so extract the block 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccc9fca78a956f8f52685118734744d5ce9b14641fcb84e62296076471057ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/shims/windows/sync.rs:266-276 | src/shims/windows/sync.rs:282-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. 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":"src/shims/windows/sync.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57855c9e2fdad5f81449b16db0d65167af93d909b8d2891260a19b324a3a805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): src/shims/unix/freebsd/foreign_items.rs:39-46 | src/shims/unix/linux/foreign_items.rs:244-251 | src/shims/unix/macos/foreign_items.rs:258-267 | src/shims/unix/solarish/foreign_items.rs:80-87 \u2014 \u0060src/shims/unix/linux/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.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 5 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/freebsd/foreign_items.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec533cdaada8e4d0ecd68bcefea669186daed8ac01096e0d11918d8d1a67064d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/shims/unix/tcp_socket.rs:349-358 | src/shims/unix/tcp_socket.rs:768-777 | src/shims/unix/udp_socket.rs:273-282 \u2014 before extracting anything, compare \u0060src/shims/unix/tcp_socket.rs\u0060 and \u0060src/shims/unix/udp_socket.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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, \u0060src/shims/unix/tcp_socket.rs:761\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/shims/unix/udp_socket.rs:266\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6365b63b111827a1dfd49d4d3639acc628a43d1bb6485258295e60983728c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/borrow_tracker/stacked_borrows/mod.rs:744-753 | src/borrow_tracker/stacked_borrows/mod.rs:794-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/borrow_tracker/stacked_borrows/mod.rs:744\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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d7f213cfdf61694a4923f3d8f9e8c76ab9fd57c801910f982419ac83424265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/borrow_tracker/tree_borrows/tree.rs:540-549 | src/borrow_tracker/tree_borrows/tree.rs:638-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/borrow_tracker/tree_borrows/tree.rs:540\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, \u0060src/borrow_tracker/tree_borrows/tree.rs:646\u0060 calls \u0060Some\u0060 and \u0060src/borrow_tracker/tree_borrows/tree.rs:550\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":"src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf5b98f9ac7eef3a63acb5fe8043678d070ca848dc6287dc4ed794c2c5ada42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/concurrency/data_race.rs:1325-1334 | src/concurrency/data_race.rs:1355-1364 \u2014 both copies are in the same file, so extract the block 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":"src/concurrency/data_race.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b8969c0dd49e55f83adf52b5662d2c394a8cbec71d709978c7c38bbac390ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/intrinsics/x86/sse.rs:164-173 | src/intrinsics/x86/sse2.rs:240-249 \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 \u0060src/intrinsics/x86/sse.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":"src/intrinsics/x86/sse.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7981ac950b61aed29be82668c3828c1a86daee9e9fc699131c892087d7f6e914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/alloc.rs:128-137 | src/shims/foreign_items.rs:329-338 \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 \u0060src/shims/alloc.rs:128\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":"src/shims/alloc.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5773713243088ac26825aeb3204d7d12b436972ca4dc943f7a4368d67fca99a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/alloc.rs:151-160 | src/shims/foreign_items.rs:348-357 \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 \u0060src/shims/alloc.rs:151\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":"src/shims/alloc.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00f34d4b9f4099deb8b85ea4688a3c5d340c68e01f62da914ab2fd281b58a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/os_str.rs:275-284 | src/shims/os_str.rs:303-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/os_str.rs:275\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":"src/shims/os_str.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfe499b47c5e7b790d1b7da4916faf26d70ae73f1508167088ef19de7ebe773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/shims/unix/fd.rs:482-491 | src/shims/unix/fd.rs:590-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fd.rs:482\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":"src/shims/unix/fd.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efd97c541a4132b9daf0bae22f3ae49f22008d6d38516ab3e3667c4416ed9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/unix/macos/foreign_items.rs:314-323 | src/shims/unix/macos/foreign_items.rs:329-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/macos/foreign_items.rs:314\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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e496b6544b6a0825b30dd04026f1c93e966d7cbe11794a52ff20ba5ca3311f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/unix/mem.rs:145-154 | src/shims/unix/mem.rs:182-191 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/mem.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"21da3e4715901e91d7301baab994b3c2e80930ff8e2c671696f0e44d6af5e23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): src/shims/unix/virtual_socket.rs:591-600 | src/shims/unix/virtual_socket.rs:674-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/virtual_socket.rs:591\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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c561c872851549a9a1e584aeb407691852a9e14f403a15e153ec218b5760e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/shims/windows/fs.rs:586-595 | src/shims/windows/fs.rs:691-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/windows/fs.rs:586\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":"src/shims/windows/fs.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"353387ea95d1dba8ca16997726aef777e0e54509dc6c6c38cf555a22d427d1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/intrinsics/aarch64.rs:325-333 | src/intrinsics/aarch64.rs:350-358 | src/intrinsics/aarch64.rs:397-405 \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":"src/intrinsics/aarch64.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9f04a6469f5be574c906244d617d72e78968464ec4557daf4e227b1e825046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/intrinsics/x86/mod.rs:338-347 | src/intrinsics/x86/mod.rs:866-875 | src/intrinsics/x86/mod.rs:912-921 \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 \u0060src/intrinsics/x86/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf5383bbb06e47817e8e93585fbb0775b33c89e5c7b5585e4375355978b3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/intrinsics/x86/mod.rs:262-270 | src/intrinsics/x86/mod.rs:279-287 \u2014 both copies are in the same file, so extract the block 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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911163ee9cd5f931b5da089e9708f722cb771ab2e4f1eadb1fee8db3f540ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/intrinsics/x86/sha.rs:77-85 | src/intrinsics/x86/sha.rs:95-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/sha.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef0aa8af6989eb5b10722b34473e38d0e6418a4a7836802a0f28d54d65d357f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:36-58 | src/shims/unix/linux/foreign_items.rs:73-95 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.rs:36\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f5ac631c576ac919405ef19d5c36b237b48662a06d6f544b70e4d32dc39a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/socket.rs:531-539 | src/shims/unix/socket.rs:615-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:531\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":"src/shims/unix/socket.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e67353ffe8a29c2f161abde64d328cb735b512e4fbfefaf37be9e0e750d40c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/windows/foreign_items.rs:602-610 | src/shims/windows/foreign_items.rs:659-667 \u2014 both copies are in the same file, so extract the block 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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"980868076bb507cb9d84e79b6dd8b5b4b7f12f6b734a65a76131a6707eb03a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/intrinsics/aarch64.rs:323-330 | src/intrinsics/aarch64.rs:348-355 | src/intrinsics/aarch64.rs:395-402 | src/intrinsics/x86/sha.rs:56-63 \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":"src/intrinsics/aarch64.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5fd4b6edcfabbb9cea138b4f9adef512c4145c643faadf271385f98169948b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/intrinsics/x86/avx.rs:134-141 | src/intrinsics/x86/avx.rs:164-171 | src/intrinsics/x86/mod.rs:1521-1528 \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 \u0060src/intrinsics/x86/avx.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/avx.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf10c26fbff2f010f952ce86ceae05a84d64574599d1087d25fb2b73b361e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/socket.rs:382-389 | src/shims/unix/socket.rs:536-543 | src/shims/unix/socket.rs:620-627 \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 \u0060src/shims/unix/socket.rs:382\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":"src/shims/unix/socket.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a336d9b854048f7801a71427c8efc348c5c7321cf67e77dd7a69ba296a7c048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/socket.rs:465-472 | src/shims/unix/socket.rs:532-539 | src/shims/unix/socket.rs:616-623 \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 \u0060src/shims/unix/socket.rs:465\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":"src/shims/unix/socket.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60f154b0510559d797c0ead8bbbaeb91835c6dd387c2f16b3d3fe929261e098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/borrow_tracker/stacked_borrows/mod.rs:602-612 | src/borrow_tracker/tree_borrows/mod.rs:245-255 \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 \u0060src/borrow_tracker/stacked_borrows/mod.rs:602\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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e39ac5e882134c35ebd3efc907379e298758125236f289cfe92a2c10859b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/intrinsics/x86/avx512.rs:235-242 | src/intrinsics/x86/mod.rs:1025-1032 \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, \u0060src/intrinsics/x86/avx512.rs:234\u0060 calls \u0060project_to_simd\u0060 and \u0060src/intrinsics/x86/mod.rs:1024\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":"src/intrinsics/x86/avx512.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90eba12668592f1e057babe2711d9bbf3ea26f987c9d2e3f8b2561faf6f2c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/intrinsics/x86/mod.rs:319-326 | src/intrinsics/x86/mod.rs:410-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/mod.rs:319\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ff0c647ee321d26e293b8ab476aa38fd3303c747039523956dbb1482821f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/machine.rs:1493-1500 | src/machine.rs:1537-1544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/machine.rs:1493\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":"src/machine.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2ef4bae9ce6311e58c38bf1e5a2ee9f822b3748e872a19e20336cb170fd704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/foreign_items.rs:364-371 | src/shims/foreign_items.rs:395-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/foreign_items.rs:364\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":"src/shims/foreign_items.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e096f53b18110bdf543e2fa7d629691105de7b6025564a7598eb0970e559a232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:101-108 | src/shims/unix/netbsd/foreign_items.rs:28-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/android/foreign_items.rs:101\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"719950a2e8b38fc591a3639c663cb5d835dc39b41f280d64c1163ef958f6ec21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:112-119 | src/shims/unix/linux/foreign_items.rs:271-278 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d27d1326d21553dd0a8a7b1eb59be597abedcd96457e1055177e21acb3d569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/foreign_items.rs:715-722 | src/shims/unix/solarish/foreign_items.rs:151-158 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e6b4ecf0f0c5d878e58df3aceb0f9424259749d0728b5a3258956448aabaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/socket.rs:469-476 | src/shims/unix/socket.rs:877-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:469\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":"src/shims/unix/socket.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1706e0877e2ac0a47594f8148d1bffac43bec0f4a77dc82f707535abfca110a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/socket.rs:502-509 | src/shims/unix/socket.rs:606-613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:502\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":"src/shims/unix/socket.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ee07bbc618476fc0250dc9632685674fa4c13ad8db992ad65b1124ed1ab605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/socket.rs:837-844 | src/shims/unix/socket.rs:869-876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:837\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":"src/shims/unix/socket.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d178814bdefc9f8afc8b62aa34f55a1c13fef77c67b2d0dbec535f396b50a679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/intrinsics/x86/avx.rs:134-140 | src/intrinsics/x86/avx.rs:164-170 | src/intrinsics/x86/gfni.rs:48-54 | src/intrinsics/x86/mod.rs:338-344 | src/intrinsics/x86/mod.rs:517-523 | src/intrinsics/x86/mod.rs:866-872 | src/intrinsics/x86/mod.rs:912-918 | src/intrinsics/x86/mod.rs:1265-1271 | src/intrinsics/x86/mod.rs:1363-1369 | src/intrinsics/x86/mod.rs:1521-1527 \u2014 there are 10 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 10 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/avx.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/avx.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60e12bfee0b7d19f21cb0076c7d3102a63bcccfc160e071c0450c79af95e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): src/intrinsics/aarch64.rs:323-329 | src/intrinsics/aarch64.rs:348-354 | src/intrinsics/aarch64.rs:372-378 | src/intrinsics/aarch64.rs:395-401 | src/intrinsics/x86/sha.rs:56-62 | src/intrinsics/x86/sha.rs:76-82 | src/intrinsics/x86/sha.rs:94-100 \u2014 there are 7 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 7 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, \u0060src/intrinsics/aarch64.rs:368\u0060 calls \u0060expect_target_feature_for_intrinsic\u0060 and \u0060src/intrinsics/x86/sha.rs:73\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aebe66f12f7f3112d714c7d9df22432c2d5dff1834c9ebd6c0d78061df0092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/shims/unix/socket.rs:326-332 | src/shims/unix/socket.rs:347-353 | src/shims/unix/socket.rs:734-740 | src/shims/unix/socket.rs:771-777 | src/shims/unix/socket.rs:844-850 | src/shims/unix/socket.rs:918-924 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/shims/unix/socket.rs:767\u0060 calls \u0060read_pointer\u0060 and \u0060src/shims/unix/socket.rs:344\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":"src/shims/unix/socket.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c5a45b77140c6abad84d2660e6edb554ee4ad577b140a2959d9aa9a54dfa28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/shims/unix/socket.rs:381-387 | src/shims/unix/socket.rs:468-474 | src/shims/unix/socket.rs:535-541 | src/shims/unix/socket.rs:619-625 | src/shims/unix/socket.rs:876-882 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/shims/unix/socket.rs:378\u0060 calls \u0060Some\u0060, \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/shims/unix/socket.rs:873\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":"src/shims/unix/socket.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8bcc723c7b329de6976ccfbc0937cb5a0818db14325ed1dd63d4c754ae20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/intrinsics/aarch64.rs:232-237 | src/intrinsics/simd.rs:81-87 | src/intrinsics/x86/mod.rs:427-433 \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 \u0060src/intrinsics/aarch64.rs:232\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbbb6edcc47f29f387eb433e982a205f39355d706e81b99a055b864abd73072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:81-88 | src/shims/unix/linux/foreign_items.rs:207-214 | src/shims/unix/solarish/foreign_items.rs:37-44 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.rs:81\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9206c0bfaecaa6e67507303ea9f0dacb0d155009ae8468243e09c65966917a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:96-102 | src/shims/unix/linux/foreign_items.rs:222-228 | src/shims/unix/solarish/foreign_items.rs:54-60 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/solarish/foreign_items.rs:54\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, \u0060src/shims/unix/solarish/foreign_items.rs:53\u0060 calls \u0060assert_target_os\u0060 and \u0060src/shims/unix/android/foreign_items.rs:95\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"799bb8f2d446f4a2b940acb2369f67ab33e6e7c8dacb0b897748b5bd3bd0996d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/concurrency/data_race.rs:848-854 | src/concurrency/data_race.rs:896-903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/concurrency/data_race.rs:848\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":"src/concurrency/data_race.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e398d7e60c4f74df57c34001fa3f2d701f4dd213e940ef3c077d9c594db7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/concurrency/genmc/shims.rs:75-82 | src/concurrency/genmc/shims.rs:141-147 \u2014 both copies are in the same file, so extract the block 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":"src/concurrency/genmc/shims.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0e695c905c6a74adf56859ce26b3a013800cf08f161a53c40c7f149284dc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/intrinsics/simd.rs:23-29 | src/intrinsics/simd.rs:80-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 \u0060src/intrinsics/simd.rs:23\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":"src/intrinsics/simd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e001a184d8d08e966a57a40f31c7900254e15bc275e1825ab6d17fcec5ce236d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): src/intrinsics/x86/mod.rs:798-804 | src/intrinsics/x86/mod.rs:831-837 | src/intrinsics/x86/mod.rs:1188-1191 | src/intrinsics/x86/mod.rs:1236-1239 \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 \u0060src/intrinsics/x86/mod.rs:798\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, \u0060src/intrinsics/x86/mod.rs:829\u0060 calls \u0060field\u0060, \u0060bits\u0060, \u0060strict_sub\u0060 and \u0060src/intrinsics/x86/mod.rs:796\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"892ed1863b0a2bdd98a1734c8494117a7a946ca051a3a95d2b47015242081b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/cpu_affinity.rs:103-109 | src/shims/cpu_affinity.rs:158-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/cpu_affinity.rs:103\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":"src/shims/cpu_affinity.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"704c6a8ee263f5cff11093c999bbbf437c7732766fb37cd159b8b57060136fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:208-214 | src/shims/unix/foreign_items.rs:218-224 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cab006079807ccdc9dc0420acebb1d366efd199af9254df10bd98f0725d061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:390-396 | src/shims/unix/macos/foreign_items.rs:68-74 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7535a607ee4726523fa1316a36449eeaa369ac61f2e587603b726460128237c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:398-404 | src/shims/unix/macos/foreign_items.rs:60-66 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3f57aa89c38a2f98559101c26894695451a73ab16aba72995c6b6b41d0245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:406-412 | src/shims/unix/macos/foreign_items.rs:52-58 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b887f681df4c11d5b10698fb0cc3fbe0895f7f353b97b8683b1e7b0bca7288f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:578-584 | src/shims/unix/macos/foreign_items.rs:95-101 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3494d6a922abce69d28123724b2388534f5cf79a356483b282ec375cfc16b251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:633-639 | src/shims/unix/solarish/foreign_items.rs:113-119 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"750b8a6b1f2dcda079ce11287148d11c995dd7dc1c605001605d55741279efd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:1277-1283 | src/shims/unix/linux/foreign_items.rs:333-339 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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. 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b9b8af1874808b3873d87d2071f8631e9032a0f3deb050323e36e8299ad73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/fs.rs:1462-1468 | src/shims/unix/fs.rs:1593-1599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:1462\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":"src/shims/unix/fs.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d58e3ba6d3d347148b3a2a12114266b07e60edc73211f60fa64cfd6897e2e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/linux_like/epoll.rs:323-329 | src/shims/unix/linux_like/epoll.rs:353-359 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6238989d64294b86c88598647cad3162a80bd3d1d235bd585e78fe687895d1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/linux_like/sync.rs:56-62 | src/shims/unix/linux_like/sync.rs:194-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/linux_like/sync.rs:56\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":"src/shims/unix/linux_like/sync.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c930cc6d1ab632c496faa1d8c38ebc33b5beef2ee88bea899dd22eafb94ee63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/tcp_socket.rs:662-668 | src/shims/unix/virtual_socket.rs:316-322 \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 \u0060src/shims/unix/tcp_socket.rs:662\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5113f11918f4668c604f50c026d0f7555fa193a6a9b07462bcdb469290c485e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): src/intrinsics/aarch64.rs:27-32 | src/intrinsics/x86/avx.rs:134-140 | src/intrinsics/x86/avx.rs:164-170 | src/intrinsics/x86/gfni.rs:48-54 | src/intrinsics/x86/mod.rs:338-344 | src/intrinsics/x86/mod.rs:517-523 | src/intrinsics/x86/mod.rs:866-872 | src/intrinsics/x86/mod.rs:912-918 | src/intrinsics/x86/mod.rs:1265-1271 | src/intrinsics/x86/mod.rs:1363-1369 | src/intrinsics/x86/mod.rs:1521-1527 \u2014 there are 11 copies across 4 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 11 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/aarch64.rs:27\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6becdd60cda7c2fcfa51a6afb5203c2705a1a022b9304f2fb594a41dc1bf9a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:89-95 | src/shims/unix/linux/foreign_items.rs:215-221 | src/shims/unix/solarish/foreign_items.rs:46-52 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f8d4ad351e021b067f3638563112b00f3151d1a39bc55c82eae814b449cb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/shims/unix/socket.rs:1005-1011 | src/shims/unix/socket.rs:1044-1049 | src/shims/unix/socket.rs:1109-1115 \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 \u0060src/shims/unix/socket.rs:1005\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":"src/shims/unix/socket.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf61106d07102dfa3b674482cd2e328ee6bbcc91c1edf2fc150cef5692b1128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cargo-miri/src/arg.rs:105-110 | cargo-miri/src/arg.rs:116-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cargo-miri/src/arg.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. 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":"cargo-miri/src/arg.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c90422192cef11fc851b4f950bb829ee370753e6e9bc828d6e329ca01b2489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/borrow_tracker/tree_borrows/wildcard.rs:202-207 | src/borrow_tracker/tree_borrows/wildcard.rs:232-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 \u0060src/borrow_tracker/tree_borrows/wildcard.rs:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn update_exposure_for_protector_release(\u0026mut\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":"src/borrow_tracker/tree_borrows/wildcard.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a9a2823638bf59f72e5e90d5cea824b4ee08a70234ad1000c014766971a897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/intrinsics/x86/avx.rs:190-196 | src/intrinsics/x86/sse3.rs:25-30 \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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ad337ff3f680d5081a32313d398fddfea4049e07cbaaade976644bc2755c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/intrinsics/x86/bmi.rs:32-37 | src/intrinsics/x86/sse42.rs:449-454 \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 \u0060src/intrinsics/x86/bmi.rs:32\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":"src/intrinsics/x86/bmi.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4f00a1e5ee2f32557cc62a1bf9fb502dc98b48ade7eaf0c5dc979d35a4248b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/intrinsics/x86/sse.rs:124-129 | src/intrinsics/x86/sse2.rs:200-205 \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":"src/intrinsics/x86/sse.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ab086caa9bc4f0b1ab776df9753493541eda0f26f45f0ba9d13ec0558bb5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:62-68 | src/shims/unix/linux/foreign_items.rs:142-148 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.rs:62\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeccd53e06ea0f42cc895732c7c50e10002a791f144cf6006943dbabaeeb5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:243-249 | src/shims/unix/foreign_items.rs:254-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/foreign_items.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8362c40bd8ccce1bab901c541d07ba9c3d63e9ac781efe7061f4709b7c9a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/foreign_items.rs:303-308 | src/shims/unix/foreign_items.rs:319-324 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dba77b6f5473cb1430afcac634fe527caf9ce5c0d3c77c7bf73a649f2314b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:603-609 | src/shims/unix/solarish/foreign_items.rs:103-109 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"46666170e934d7365bb06987afd4bf8f6a6336d8f049702b15aeae2c572e4c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:641-647 | src/shims/unix/solarish/foreign_items.rs:121-127 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"facd83218692e5968aee790854edbbea3b98097eb909027f12b136d83d7deee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/foreign_items.rs:1292-1297 | src/shims/unix/macos/foreign_items.rs:114-119 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18a3f65fb8a6d5ea7f27c1379d00ebeca2e044724ea09d363869e2fd73647e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/freebsd/foreign_items.rs:73-78 | src/shims/unix/linux/foreign_items.rs:131-136 \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 \u0060src/shims/unix/freebsd/foreign_items.rs:73\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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"302aa84dd63f93190e49663ebc0a4c883bea817e8073b0f218dbe64d79a0d898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/freebsd/foreign_items.rs:174-179 | src/shims/unix/linux/foreign_items.rs:362-367 \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 \u0060src/shims/unix/freebsd/foreign_items.rs:174\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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d948ac2b9cf0bbe1a7e7dbb8ea46ebface6c4acd81632b0a70df1a0c232064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/tcp_socket.rs:274-279 | src/shims/unix/udp_socket.rs:161-166 \u2014 before extracting anything, compare \u0060src/shims/unix/tcp_socket.rs\u0060 and \u0060src/shims/unix/udp_socket.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060src/shims/unix/tcp_socket.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/shims/unix/tcp_socket.rs:272\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/shims/unix/udp_socket.rs:159\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b404b664627d3bfcfbe53eea51eb912b7b1aa9de7f31c72d7f30e495f1c32472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/virtual_socket.rs:601-606 | src/shims/unix/virtual_socket.rs:612-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/virtual_socket.rs:601\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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"619724aad30b6a070a2e50b3023539fdcc75c42998dcb5fe8b1841930d9ebf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): src/intrinsics/x86/gfni.rs:79-83 | src/intrinsics/x86/mod.rs:307-311 | src/intrinsics/x86/mod.rs:337-341 | src/intrinsics/x86/mod.rs:516-520 | src/intrinsics/x86/mod.rs:582-586 | src/intrinsics/x86/mod.rs:865-869 | src/intrinsics/x86/mod.rs:911-915 | src/intrinsics/x86/mod.rs:1025-1032 | src/intrinsics/x86/mod.rs:1172-1180 | src/intrinsics/x86/mod.rs:1264-1268 | src/intrinsics/x86/mod.rs:1362-1366 | src/intrinsics/x86/mod.rs:1520-1524 \u2014 there are 12 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 12 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, \u0060src/intrinsics/x86/mod.rs:1185\u0060 calls \u0060is_power_of_two\u0060, \u0060from\u0060, \u0060strict_sub\u0060 and \u0060src/intrinsics/x86/mod.rs:1527\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":"src/intrinsics/x86/gfni.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e681189ab5bb7dd008900931f28339af961e58b8af21cbbf1ac629077a1e5391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/shims/unix/android/foreign_items.rs:32-37 | src/shims/unix/android/foreign_items.rs:43-48 | src/shims/unix/foreign_items.rs:245-250 | src/shims/unix/foreign_items.rs:256-261 | src/shims/unix/linux/foreign_items.rs:69-74 | src/shims/unix/linux/foreign_items.rs:80-85 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.rs:32\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a393cb7d88023efd732a6e89710f6804c4a4563e6c826e2be92ca4ef40a939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/shims/unix/fs.rs:886-891 | src/shims/unix/linux_like/epoll.rs:89-93 | src/shims/unix/socket.rs:716-720 | src/shims/unix/socket.rs:757-761 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/fs.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eb41b963470c5ada79f8562c8c78192b8e1fb3e6f826bb92a5f722fa155df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/shims/unix/virtual_socket.rs:596-600 | src/shims/unix/virtual_socket.rs:607-611 | src/shims/unix/virtual_socket.rs:675-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/virtual_socket.rs:596\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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf96dfbfa8e1d8b8e83f97c8e6e959a0d85d3a77daa2828a38b362ec896ca2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/aarch64.rs:66-70 | src/intrinsics/x86/mod.rs:1223-1227 \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":"src/intrinsics/aarch64.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1578181258ca96bbd47d048d69204dbb97b4ff4d7d1d331ad8ba8acddec3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/intrinsics/aarch64.rs:441-447 | src/intrinsics/x86/sha.rs:133-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/sha.rs:133\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bb5dd870ac2d5394b792114f414616130ac5b81fd3a974d748a6aa3b378097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/intrinsics/simd.rs:29-35 | src/intrinsics/simd.rs:63-71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/simd.rs:29\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":"src/intrinsics/simd.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc7f95d467b14950dcebcd920a7282fc146e3c0b3fafccfa4f9c733ba7a7513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/intrinsics/x86/avx.rs:90-96 | src/intrinsics/x86/sse.rs:111-117 \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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a398ddf30d05b2791d0dbab5cd98206601681b9648aa90fec81062083710d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/intrinsics/x86/avx.rs:102-108 | src/intrinsics/x86/sse2.rs:187-193 \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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3334eb582de2972401083406aed040dc7bc69759cd74ac69b20eeb20ddb2c872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/intrinsics/x86/avx.rs:200-206 | src/intrinsics/x86/sse41.rs:151-157 \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":"src/intrinsics/x86/avx.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c025fd1b64ec6079bbc86b9ddfd68a936db4d062f00ecabf2a65898ff30b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/x86/avx512.rs:235-242 | src/intrinsics/x86/mod.rs:1222-1226 \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":"src/intrinsics/x86/avx512.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bc44c1e19ee118e2e51c43a9e3435a0d202007706c44212f762d7230956bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/x86/mod.rs:746-750 | src/intrinsics/x86/mod.rs:974-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/x86/mod.rs:746\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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f29bb770e931bde9dd5aebdbd1725884167c98b17f33320591445b3b495498d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/x86/mod.rs:1173-1181 | src/intrinsics/x86/sse41.rs:30-34 \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":"src/intrinsics/x86/mod.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"827659bde7e55d52e13cce51811516aac3cee64fb09310ba6260dac658c8f17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/fd.rs:385-389 | src/shims/unix/fd.rs:434-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/fd.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"21387abd6e85c37b81d61cccaf4ec699f817044a9ee351fa9823cb7f16f17165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/shims/unix/foreign_items.rs:357-366 | src/shims/unix/linux/foreign_items.rs:55-65 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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. 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 \u0060src/shims/unix/foreign_items.rs:357\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b25be7c9604b9b5800535771db91f09c9840f9aa60d26c94becd47e17954e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:414-420 | src/shims/unix/macos/foreign_items.rs:76-82 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3bc0eec72257ad1f71001f566f13ab8e2432fbf6e6f7e539d4296573939c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/foreign_items.rs:671-676 | src/shims/unix/solarish/foreign_items.rs:129-134 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8100849e0976f8ffc30c8880ab766e2decb3909d6804a894a0de9d1160557c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:747-753 | src/shims/unix/solarish/foreign_items.rs:143-149 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a621ffe081a5ed51941b36e584f1661e2c738a92e7641090ab2206468a030bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:1123-1127 | src/shims/unix/macos/foreign_items.rs:431-435 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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 \u0060src/shims/unix/foreign_items.rs:1123\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"79601651358af91e6f7a8bab1d979e5d064d9da41e6255191796821d5d6a74cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/thread.rs:53-57 | src/shims/unix/thread.rs:71-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/thread.rs:53\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":"src/shims/unix/thread.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"824c064dd39e617372db9d8c8a0c3259bd507a5bf301d8230d2aeb3c3d3b520c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/tcp_socket.rs:224-232 | src/shims/unix/udp_socket.rs:112-120 \u2014 before extracting anything, compare \u0060src/shims/unix/tcp_socket.rs\u0060 and \u0060src/shims/unix/udp_socket.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67799cc07a5dcc72a0df6c96428ab4962c8654c4e72efbfd559a6d1dc174a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/mem.rs:160-174 | src/shims/unix/mem.rs:210-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/mem.rs:160\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":"src/shims/unix/mem.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7709cb5d8e2094f59ec5fe0ec7a95e159be2d4d5be3f8f99dbd55819457ada43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/shims/unix/tcp_socket.rs:613-624 | src/shims/unix/tcp_socket.rs:668-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/tcp_socket.rs:613\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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1646721496088c604a73cd2a70cb4000b0ebbc6e8edfdc8eee8a43a3a257c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/shims/unix/fs.rs:1034-1045 | src/shims/unix/fs.rs:1868-1878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:1034\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":"src/shims/unix/fs.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"d040eccf3f747b62c5a404ff9bb4edacc4187d5e35459e615f3b138392c23330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/linux_like/thread.rs:28-38 | src/shims/unix/linux_like/thread.rs:44-51 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/linux_like/thread.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60fa688758fd19b52ee087b7fb334310599ea4ab82732a7b35b725e6717ac5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims/unix/socket.rs:1186-1195 | src/shims/unix/socket.rs:1226-1236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:1186\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":"src/shims/unix/socket.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fad01cf0c3766877a2786d8c66a60c9f384252658f0e2104fc4b9019067f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/shims/unix/foreign_items.rs:941-951 | src/shims/windows/foreign_items.rs:617-625 | src/shims/windows/foreign_items.rs:674-682 \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 \u0060src/shims/unix/foreign_items.rs:941\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc0305c2137bfdecead042aa1ad2b301fbcee8d51f4271e4c8e902b6b08767d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/intrinsics/aarch64.rs:338-347 | src/intrinsics/aarch64.rs:385-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/aarch64.rs:338\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bcaa891a0a7592bb1ceb46be879412061498987c6826892b8b6a690876deb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/borrow_tracker/stacked_borrows/mod.rs:701-710 | src/borrow_tracker/tree_borrows/mod.rs:289-298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd75d5aeb92e4156de94c3440de0fc0ca28f9b9ab3663fa5a6a6634e5e6da0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/windows/foreign_items.rs:1203-1211 | src/shims/windows/foreign_items.rs:1212-1219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/windows/foreign_items.rs:1203\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a259f4d12e960f23a861ef77532f8d5744a311b8b4a909a7e1c281b7e26a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/fs.rs:813-821 | src/shims/unix/fs.rs:1364-1372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:813\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":"src/shims/unix/fs.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd2941486797a4b6bfc0bf954c8b99312c6177a12b9a61e6f189277e04398e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/thread.rs:101-109 | src/shims/unix/thread.rs:137-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/thread.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e89484e11989ab15897160ba7ed0b63c42c96cee38304044c6e7fd54f71713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/shims/unix/fs.rs:937-945 | src/shims/unix/fs.rs:965-973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:937\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":"src/shims/unix/fs.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8c823f71b151d7d732618925338fe75ac64d052be8b038d4b78afb7c7276b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/macos/foreign_items.rs:340-348 | src/shims/unix/macos/foreign_items.rs:350-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/macos/foreign_items.rs:340\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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08424a82b050d55cd18e4fb9f55a61383f476e82585953460df31a1350d405c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/fs.rs:1801-1808 | src/shims/unix/fs.rs:1931-1938 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:1801\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":"src/shims/unix/fs.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"296d6e2ddb82b8862c41e3d0a1ab7240df200f4f51d1a90c4a8bd4bb6bd115b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/windows/foreign_items.rs:185-192 | src/shims/windows/foreign_items.rs:221-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/windows/foreign_items.rs:185\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c3e89e0a998a3da2ac33382b465a23dd3eabe9ce4134e98a3338718bc5ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:68-75 | src/shims/unix/foreign_items.rs:497-502 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"16adc698f5870ab0243e15e4e6bf341359a3ba0e56a3b6a025f47ad98b3007a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/socket.rs:971-978 | src/shims/unix/socket.rs:1107-1114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/socket.rs:971\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":"src/shims/unix/socket.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c9ceaddfab030242c77ebd1491b1159a966ad24b469cbe2154b3aff28e5e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:826-833 | src/shims/unix/foreign_items.rs:1234-1240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:826\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaf9ded644a40ba6cea30ba3d3abbc0f0b10034b817142f3ffc886a0b4409ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/foreign_items.rs:197-204 | src/shims/unix/solarish/foreign_items.rs:223-230 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc355a45678b54c4128d528e8e65b326583f8277f074aeeb5940c27b8f1ea956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/foreign_items.rs:139-144 | src/shims/unix/netbsd/foreign_items.rs:25-32 \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 \u0060src/shims/unix/foreign_items.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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba89ccf07b422cfcf5bd520936b8ab04698b5b2a65160dacf7542ea50e97ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/socket.rs:1182-1189 | src/shims/unix/socket.rs:1198-1205 | src/shims/unix/socket.rs:1222-1229 \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. 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":"src/shims/unix/socket.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2418407eca54136bab4bf902fdadd2ef888c37f15d52ae4962ad5b4c74170270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/windows/foreign_items.rs:407-413 | src/shims/windows/foreign_items.rs:1077-1084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/windows/foreign_items.rs:407\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d50c21274c018c5140162088ef0b31efc0e03656efea5ab386a13fdef07c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/windows/foreign_items.rs:194-201 | src/shims/windows/foreign_items.rs:415-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/windows/foreign_items.rs:194\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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b0620186c5a0479bb1531e3f4639bf6a4904607ccad47546bad4a72ba4a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/shims/unix/socket_address.rs:182-196 | src/shims/unix/socket_address.rs:211-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/socket_address.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d458fccf6872249929fb7953ec198c7449edb7db21883c5086953400a52e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:419-425 | src/shims/unix/foreign_items.rs:443-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 \u0060src/shims/unix/foreign_items.rs:419\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4f3bf83444f75248200b39b1eeb3378d3924110035915f0da267ca70e020f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:65-74 | src/shims/unix/foreign_items.rs:494-501 | src/shims/unix/linux/foreign_items.rs:145-152 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.rs:65\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2898fc8cb26874fbff6e13878f284de2039a50a24541f1e769acfce90db8352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/macos/foreign_items.rs:39-45 | src/shims/unix/solarish/foreign_items.rs:164-170 \u2014 \u0060src/shims/unix/macos/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.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 3 separate duplicated blocks between them, totalling at least 35 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 \u0060src/shims/unix/macos/foreign_items.rs:39\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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"026593d4672d9b48a6b0e718e4ad28a4aee9d4f0790f1d0dccf5da9177fe52d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:371-377 | src/shims/unix/foreign_items.rs:435-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:371\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a4202cf51168aa9800a811f0fa4fe641e24ccfdc635bc520deb12fc72a2fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:810-816 | src/shims/unix/foreign_items.rs:818-824 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:810\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"772343d20e4303446ea0343bcc02b4b3c0bf5aff0151ca0773d7789f3ec29455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/shims/unix/fs.rs:1782-1788 | src/shims/unix/fs.rs:1800-1806 | src/shims/unix/fs.rs:1930-1936 \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 \u0060src/shims/unix/fs.rs:1782\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":"src/shims/unix/fs.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e3b1a91957e1523930cbd516f02d037e37b41e982a9f7c02553cb4df195ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/shims/unix/fs.rs:1782-1788 | src/shims/unix/fs.rs:1800-1806 | src/shims/unix/fs.rs:1825-1830 | src/shims/unix/fs.rs:1930-1936 \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 \u0060src/shims/unix/fs.rs:1782\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, \u0060src/shims/unix/fs.rs:1822\u0060 calls \u0060deref_pointer\u0060 and \u0060src/shims/unix/fs.rs:1797\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":"src/shims/unix/fs.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef6c87ed728269edbb34453fa8e19bde6fc42d982291e642810fd4d550d29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/fs.rs:1030-1036 | src/shims/unix/socket.rs:234-240 \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 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":"src/shims/unix/fs.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"f804d71ba817c02d454f98ea406d51ef2a553563dc824a3bfe5788e4cdc332d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/fs.rs:991-996 | src/shims/unix/fs.rs:1023-1028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/fs.rs:991\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 after the matched lines, \u0060src/shims/unix/fs.rs:1029\u0060 calls \u0060read_pointer\u0060, \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/shims/unix/fs.rs:999\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":"src/shims/unix/fs.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a947397afa840eee6d8c1f0249a20cb9be986dc8ce235a52125425d12ce8f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/intrinsics/aarch64.rs:317-322 | src/intrinsics/aarch64.rs:342-347 | src/intrinsics/aarch64.rs:389-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 \u0060src/intrinsics/aarch64.rs:317\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2bd039bb3889d56010db8e6012b926017df932d88b35c6fbd60002363ef6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/fs.rs:1074-1079 | src/shims/unix/fs.rs:2222-2227 \u2014 both copies are in the same file, so extract the block 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":"src/shims/unix/fs.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"32406221626aaeb9f724641d6b8a5fc77fc918b4b9f7f53cdea9a37439d054ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:108-113 | src/shims/unix/linux/foreign_items.rs:343-347 \u2014 \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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 12 separate duplicated blocks between them, totalling at least 129 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 \u0060src/shims/unix/android/foreign_items.rs:108\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f2b3369de65edbc4e8d704a4ee81eb5b911995e93fd73a4179704ffe8a146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/intrinsics/x86/sse.rs:152-157 | src/intrinsics/x86/sse2.rs:228-233 \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 \u0060src/intrinsics/x86/sse.rs:152\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":"src/intrinsics/x86/sse.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d6c3e4b7165da8ec82151aea2c50cacf8872e33ababc0cc596a3a5a5d9269c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/shims/unix/foreign_items.rs:654-659 | src/shims/unix/foreign_items.rs:721-726 | src/shims/unix/foreign_items.rs:729-734 \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 \u0060src/shims/unix/foreign_items.rs:654\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"77015ef51311c33047f8fd4201f86455cc1f65d5fe4029ac5581382f10db7416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/shims/unix/foreign_items.rs:459-464 | src/shims/unix/macos/foreign_items.rs:83-88 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f506e3dc96bef1e740741ecd1e8c9a7d23df4c77652b5a328f5bea7400f6450d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/foreign_items.rs:685-692 | src/shims/unix/solarish/foreign_items.rs:136-143 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/solarish/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 58 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 \u0060src/shims/unix/foreign_items.rs:685\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"05de4aa8f45b50f36d5a7db13e0cc0df66b6ec735d21bda72ae4b0e94212d962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/shims/unix/foreign_items.rs:1236-1243 | src/shims/unix/foreign_items.rs:1246-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:1236\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66153a4a670ca6d3b5b8c78c856ce8ae4ae8d91eeff6ad234b2b678e5c15c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:265-269 | src/shims/unix/foreign_items.rs:272-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 \u0060src/shims/unix/foreign_items.rs:265\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c27571f205053ca1a81b2fef7aff5c91fb52484012ac9760853fa446fa74e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/android/foreign_items.rs:59-63 | src/shims/unix/foreign_items.rs:488-492 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.rs:59\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cf0dbe97fc26710a4209e878fc2983bfa550e18b2c686fbec3950b68da9aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/x86/sse.rs:94-98 | src/intrinsics/x86/sse2.rs:170-174 \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 \u0060src/intrinsics/x86/sse.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/x86/sse.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d56de5a0ab540fc9630f2fff025491f7ed06b031cd64b26633ff5196931781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:469-473 | src/shims/unix/macos/foreign_items.rs:87-91 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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 \u0060src/shims/unix/foreign_items.rs:469\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"16049d967380adfd71eaeeac363725d267e19cbf65b63fa2c35563ee4ceaea04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/intrinsics/aarch64.rs:62-66 | src/intrinsics/aarch64.rs:149-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/intrinsics/aarch64.rs:62\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":"src/intrinsics/aarch64.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae187cc08cb3c8a9e42d72db7771226068370e14374c6d44436a3d0cb30599af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:55-62 | src/shims/unix/foreign_items.rs:484-491 | src/shims/unix/linux/foreign_items.rs:92-99 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.rs:55\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"040ac01fe9aac4c2715dcbe1387222990b736d320dc3b60ba9adbf13157dc184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:228-232 | src/shims/unix/foreign_items.rs:235-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:228\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251a1bfea624b8bfe220c2dfe08ca56b0418a33f905657841e0a88e98ce9258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/shims/unix/foreign_items.rs:469-473 | src/shims/unix/linux/foreign_items.rs:181-185 | src/shims/unix/macos/foreign_items.rs:87-91 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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. 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 \u0060src/shims/unix/foreign_items.rs:469\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e7926ead660f03da00f3c9d3cced33ecf404d5efc8272398eabbda0ca8ce9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:677-681 | src/shims/unix/foreign_items.rs:691-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/shims/unix/foreign_items.rs:677\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6078dc2386f2e26c4ff5e42556ad418a4f19fa0a3492e959f844398d3b788cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/shims/unix/foreign_items.rs:281-287 | src/shims/unix/macos/foreign_items.rs:45-51 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/macos/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 69 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 \u0060src/shims/unix/foreign_items.rs:281\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d884af41baefbe9a0bdb5ac746d6f9fe64c51f681e81cf814c0bd2d9182009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/shims/unix/foreign_items.rs:167-171 | src/shims/unix/foreign_items.rs:451-455 | src/shims/unix/foreign_items.rs:583-587 \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 \u0060src/shims/unix/foreign_items.rs:167\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb06d51e4249628b9b4e755e59fc634d13988453083af9694241670b38163d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/shims/unix/android/foreign_items.rs:34-41 | src/shims/unix/foreign_items.rs:247-254 | src/shims/unix/linux/foreign_items.rs:71-78 \u2014 before extracting anything, compare \u0060src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/shims/unix/foreign_items.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 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 \u0060src/shims/unix/android/foreign_items.rs:34\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":"src/shims/unix/android/foreign_items.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d62d82887acb754bfa19f83acf2948c5e6a668ecd11a5a5c7010cf722b16a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/operator.rs:30-34 | src/operator.rs:35-39 \u2014 both copies are in the same file, so extract the block 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":"src/operator.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd4a6ec91a7419f21a2a0ac44e32b8a0b934e273dfd9cb0d8d3e4f80f3aa813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/shims/unix/foreign_items.rs:567-571 | src/shims/unix/linux/foreign_items.rs:119-123 \u2014 before extracting anything, compare \u0060src/shims/unix/foreign_items.rs\u0060 and \u0060src/shims/unix/linux/foreign_items.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. 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 before the matched lines, \u0060src/shims/unix/linux/foreign_items.rs:118\u0060 calls \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/shims/unix/foreign_items.rs:565\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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e502640405bda3b1c2ab3209d252adacbfc77350b82c57084ad2daa4c53427f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): test-cargo-miri/subcrate/main.rs:4-33 | test-cargo-miri/subcrate/test.rs:6-38 \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":"test-cargo-miri/subcrate/main.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"48579d612535bf7e837b072c30632e0f8e56e52efd2830059b48947a868b26f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): test-cargo-miri/src/main.rs:34-49 | test-cargo-miri/subcrate/main.rs:14-30 | test-cargo-miri/subcrate/test.rs:16-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-cargo-miri/src/main.rs:34\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":"test-cargo-miri/src/main.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cb85d24a5106743b1e9c69934dc3e5b17c7135ddaf6eb3b3e55b206c992f4c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DisplayFmt (LCOM4 4): DisplayFmt\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":"src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c7f7a99016bc0f7eefa7a4ed20aab583dc35330ea58bf7187a40cd27f31ac1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UdpSocket (LCOM4 4): UdpSocket\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":"src/shims/unix/udp_socket.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1408d9fed3deb576549843b78d9123296419c7697682cd9b165a79ae7ba211"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/foreign_items.rs: src/shims/unix/foreign_items.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in EvalContextExt::emulate_foreign_item_inner at line 110. 2 of those changes were fix/bug commits, and the other 48 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/foreign_items.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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"70132ea67d8f90abf2c1c354354dd56ffbf9b1fb0a3519cb73dd277f163c1062"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/fs.rs: src/shims/unix/fs.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in EvalContextExt::open at line 475. 5 of those changes were fix/bug commits, and the other 54 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/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":"src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"211154dd14c5a25944e95e229cc5c79e45c1acb73a3f07f2fd4e1af22afcba2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/windows/foreign_items.rs: src/shims/windows/foreign_items.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in EvalContextExt::emulate_foreign_item_inner at line 132. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/windows/foreign_items.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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec51d1454bc58d794aa908ec8355deaf003b4236f113997903a45b958da48929"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/foreign_items.rs: src/shims/foreign_items.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in EvalContextExtPriv::emulate_foreign_item_inner at line 258. 1 of those changes was a fix/bug commit, and the other 23 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/foreign_items.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":"src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"647c9003e768cc797327a8a28a72ebc82255958b6fd0b485af41fe0d9e5959c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/linux/foreign_items.rs: src/shims/unix/linux/foreign_items.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in EvalContextExt::emulate_foreign_item_inner at line 35. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/linux/foreign_items.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":"src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e89c6821914113cdfef1a1af006133bf80930d3efebfe0c026aad373eb331a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/macos/foreign_items.rs: src/shims/unix/macos/foreign_items.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in EvalContextExt::emulate_foreign_item_inner at line 23. 2 of those changes were fix/bug commits, and the other 18 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/macos/foreign_items.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":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a66f7c5155853c9ca0f685b2ae62ab8cb1a20c0468c47934ad59c9c809f315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/windows/fs.rs: src/shims/windows/fs.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in EvalContextExt::CreateFileW at line 109. 1 of those changes was a fix/bug commit, and the other 18 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/windows/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":"src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1030b7ff7bd566efbaac14debee7d196e620918aef6cc3917213314559c667d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/socket.rs: src/shims/unix/socket.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EvalContextExt::set_generic_socket_option at line 947. 1 of those changes was a fix/bug commit, and the other 39 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/socket.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":"src/shims/unix/socket.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"243d21e7b919a461ebcbcf1de76c452800dc8c0b76027bcfe64feab354d0de84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/diagnostics.rs: src/diagnostics.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in miri::diagnostics::report_result at line 249. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/diagnostics.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":"src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8620cb6b9659520deed42e56bcd7f476672c0f02250515efe0faa94a4e03b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/solarish/foreign_items.rs: src/shims/unix/solarish/foreign_items.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EvalContextExt::emulate_foreign_item_inner at line 18. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/solarish/foreign_items.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":"src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7131f696577486017b8bba1d62e5443066390ed4f7153c58208513b06c7f0a03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: priroda/src/debugger.rs: priroda/src/debugger.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PrirodaContext::resume at line 318. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- priroda/src/debugger.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":"priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4718c9e6f14f11fe76613bfa6d1673375cbe5454271934d08c05776fbb24b8a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/math.rs: src/intrinsics/math.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in EvalContextExt::emulate_math_intrinsic at line 92. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/math.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":"src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eabb893f6687fd1741558fb251b3c5e20a144403d8c22b29b3038154c6ffa99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/fd.rs: src/shims/unix/fd.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EvalContextExt::fcntl at line 259. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/fd.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":"src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3455dd6386c28b652e9c1af7f583f964e60a6e9948b00115ac2ef3cef07f2729"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/machine.rs: src/machine.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MiriMachine::extern_static_pointer at line 1463. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/machine.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":"src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6085865397c28d118851044cefd27553a1ac12746d1148c7f2ec6c9eed55a3ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/x86/sse2.rs: src/intrinsics/x86/sse2.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in EvalContextExt::emulate_x86_sse2_intrinsic at line 12. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/x86/sse2.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":"src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceeb15c3974c11385fbf6d7d7f1653c97ee104172e409c81cdc2936b9ba733e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/freebsd/foreign_items.rs: src/shims/unix/freebsd/foreign_items.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EvalContextExt::emulate_foreign_item_inner at line 15. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/freebsd/foreign_items.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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f56b21d0b1a845de1fe299610a01d6422f7f9e39f9d2b3cb57cbbd2d0cf1ca4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/math.rs: src/shims/math.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in EvalContextExt::emulate_foreign_item_inner at line 11. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/math.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":"src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf14299075e451eca5c97d57da30b36c7aa070a602c9a26165d4f5abf8bdb1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/x86/avx2.rs: src/intrinsics/x86/avx2.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in EvalContextExt::emulate_x86_avx2_intrinsic at line 11. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/x86/avx2.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":"src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ad465e0a44b12aafa6ff79e7c252cd7567441502781e733c15dea1a0b4f77b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/x86/sse42.rs: src/intrinsics/x86/sse42.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in EvalContextExt::emulate_x86_sse42_intrinsic at line 295. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/x86/sse42.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":"src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897b43993e869898d6c46189a42d3a145b65a35a0c3ef8279af4825d013d8ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/x86/avx512.rs: src/intrinsics/x86/avx512.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EvalContextExt::emulate_x86_avx512_intrinsic at line 11. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/x86/avx512.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":"src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"79776fb3c157e64fc243c96a4dfee216d6f9a03c4249d1c1c1d06e9be3402fa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/linux_like/sync.rs: src/shims/unix/linux_like/sync.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in miri::shims::unix::linux_like::sync::futex at line 18. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/linux_like/sync.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":"src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d7abf8be49b3aa161e0a4b001809fc7c124811a724a46cb5c369b0fb2690c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims/unix/freebsd/sync.rs: src/shims/unix/freebsd/sync.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EvalContextExt::_umtx_op 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/shims/unix/freebsd/sync.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":"src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"105cf56801f16a96cc9c0edd2b6b25dd749fcbe33e53affafaef1ec9e2e13d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/aarch64.rs: src/intrinsics/aarch64.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in EvalContextExt::emulate_aarch64_intrinsic at line 9. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/aarch64.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":"src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e477319e85b61e13448cace0d44b6e5281bf67546ecb2580086da358085a878e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/concurrency/scheduler.rs: src/concurrency/scheduler.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EvalContextPrivExt::schedule at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 06:59:33 \u002B00:00\u0027 --until=\u00272026-11-13 06:59:33 \u002B00:00\u0027 --full-history --no-merges -- src/concurrency/scheduler.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":"src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e8c94262200bb2ac613c01ddfc6865975681574d219b80e6435e1d4760e3c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 6 significant file(s) lose their only recent owner: bench-cargo-miri/mse/src/main.rs, src/data_structures/range_object_map.rs, src/concurrency/scheduler.rs, src/alloc_addresses/reuse_pool.rs, src/data_structures/mono_hash_map.rs, test-cargo-miri/src/main.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c2a0eb6e5f0ab50ca300a1458fbba84666c3a6e685563410fd9ba9e259917a1"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (10 single-owned of 136 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; 136 of the 182 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: priroda/src/frontend/dap.rs, priroda/src/frontend/cli.rs, cargo-miri/src/arg.rs, src/borrow_tracker/stacked_borrows/item.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Automate gathering of all relevant C source files in the directory. \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":"tests/ui.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74aeb1b500405554df22f06ccb2a38bd108e1845a18e159dcadc80356cad72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make it just skip \u0060-Zmiri\u0060 flags. \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":"tests/ui.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f72f4276da0528951cdbf228508784dfefd86865a68b4f840453c32c0e7dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): remove this when GenMC and SB can be used together. \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":"tests/ui.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe600c66d16e63f6e77fd657ed3293acf3c883cffb387a7fd1c43984f016042"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,cross-platform): Technically we do support cross-target execution as long as 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":"tests/ui.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6565a0f540983c588ab40084b9d1814947540a9cbe1521abd4ffa51594a6d625"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once we support more of the std API, it would be nice to test against an actual symlink \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":"tests/pass-dep/windows-fs.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875d5e3c422ad474d7216cdbaf5abaa86238bbe1555c2909d17639ddd2a6f6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass-dep/libc/eventfd.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e61a1f98fd302e06d5a8efef935aa9a0590c7a391df09bdc2e74e81cb50ed55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass-dep/libc/pipe.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece4b876cec35711ad0032d01a72994d110be783827fa80ea73f8592a025e74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass-dep/libc/socketpair.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041597fb970a3a08163d0de59cacc26d4b0691225bb34bcbc604e2efad96229"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass-dep/concurrency/linux-futex.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab9380b115791ea2a3789832c9f8537369cb55a136d67bf321062fee3cd078"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass/atomic.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eee5548126d287425b9143e9da09004e99e09563e481aafca0088fae4409de9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass/static_memory_modification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937f054355d54a4de8ecc6b750709f7ccff4f71082f2f74d9525960f5bbf2136"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass/static_mut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332f4fd502946a0397c1db31b780b6f696ee25a3c2d681f2325b9f94126200f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of references \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":"tests/pass/tls/tls_static.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebd4a130c54b4313223bdf75af62e6766a46cd7cdd23e8d6f0c695bca64e6b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#miri/5074): except on Windows hosts... \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":"tests/pass-dep/libc/fs-flock.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ae2a987956555ce64e59a03de600e1c32c4adf9c85e38cbcdffd747ea39dd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#miri/5074): this does not behave correctly on Windows hosts. \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":"tests/pass-dep/libc/fs-flock.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9247afb8a3bb1232097c97e004ed63ae7cc0ddef2495a7b3847833b4ab33820"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: O_NOFOLLOW does not work with openat on Windows hosts. \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":"tests/pass-dep/libc/fs.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d8f23b19aa49dfa96aefbffedf03003319f29d4a696c5b5ea1a01bf931f3a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Seems like FreeBSD does not set permissions for non-file-backed FDs. \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":"tests/pass-dep/libc/fs.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"269093d62258019d9f7370d5c9eff08d0c79f2cb240f61bda9951907bc89d217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Pipes are bidirectional on FreeBSD but Miri\u0027s shim implements them as \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":"tests/pass-dep/libc/pipe.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c90c671cc0bed39be573959cc135b3f2dfdb855399565d0e21620130f73a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On Windows hosts a connecting socket is bound to the unspecified address. \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":"tests/pass-dep/libc/socket-tcp-no-blocking.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa51f9761b59cf6a245005777953a09460dbad7219d329ade417bc3b33c01f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // can\u0027t really test this natively (FIXME: test with mmap?) \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":"tests/pass-dep/concurrency/freebsd-futex.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd90efdc610f187c1a3b1d8680b03ce5c98cc5ecee152c9d3b970e660953491"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // can\u0027t really test this natively (FIXME: test with mmap?) \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":"tests/pass-dep/concurrency/linux-futex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b8c988c1c741eb92633988f10b16a7b20d8cb45415403630578a577c5110e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove once this is in libc. \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":"tests/pass-dep/concurrency/pthread_cond_timedwait_relative_np_apple.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"24df1653e829edc870e94a5af8825119aafe68b7e84b7ceceb7d3a6904e557be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): consider AsyncDestruct::async_drop cleanup tests \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":"tests/pass/async-drop.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"37053303936de89b39cb5d81b326e2fbd2f369ab74b5bdb4fac99b0eee2b71ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): Disallow types with \u0060AsyncDrop\u0060 in unions \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":"tests/pass/async-drop.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7887e9af31dffc73908338973406277d0ebdd0ea818ca3267e3528c68c49c1d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_fn_track_caller): Currently, #[track_caller] on an async function \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":"tests/pass/async-panic-track-caller.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef246100850345fc110a67c64141532da2c032cc2362d869e32f1d55a816982"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(closure_track_caller): if closure_track_caller is enabled, but \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":"tests/pass/async-panic-track-caller.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f1926a3b9f21a23540939bd29f550c4ed33b5a74a5c8126a17897edfd7ad2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (mikeyhew) uncomment this when unsized rvalues object-safety is implemented \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":"tests/pass/dyn-arbitrary-self.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c333fd90a3c3a75a5e7cebf45f8fe3409ed84fca22a0a1e07d10d9209d0e9f86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): add when supported \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":"tests/pass/float.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef6602918a3a57fc42b75a9643f1a8916539a5b7c015dcf0f6c6de61abb5d5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we call the functions in \u0060std::ops\u0060, we still get the panics. \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":"tests/pass/overflow_checks_off.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91b080f18ea2442dcb14d4d2363a3f9fd5d5fa9d63177d74e4c1ed60a0a2912"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // This fails on Windows 10 hosts. FIXME: enable this once GHA runners are on Windows 11. \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":"tests/pass/path.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"520c576d14339d9cc0f124cdc2931ccb91288b06e8c6081ac2b0750660d2e53a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also test ptr::swap, ptr::copy, ptr::copy_nonoverlapping. \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":"tests/pass/provenance.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"304f1c654f351b85eaa610032d72ea2a5c1588cdbd0438f9103e2ff7718d53c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this miscompiles with optimizations, see \u003Chttps://github.com/rust-lang/rust/issues/132898\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/stacked_borrows/stacked-borrows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0103787c7bea69506c5defe0252ec29048f5d60297a518fbb38db226cdb9e69a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is currently disabled, waiting on a decision on \u003Chttps://github.com/rust-lang/rust/issues/56604\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/stacked_borrows/stacked-borrows.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95e1e0323f4d608d4022c2a471fddaf660f8a86c4f813b5e5bd3b729c617677"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: stream_len not supported on Windows \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":"tests/pass/shims/fs.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513d13e778dc1d1c5b764cf84d16258427dd2b4a8afb14f3ef8d44ae30236f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is that intentional? \u003Chttps://github.com/rust-lang/rust/issues/163923\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/shims/fs.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cb9728f1e15402a20f50314c861c74d08a4664b42016f083bec80128bcfda9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is that intentional? \u003Chttps://github.com/rust-lang/rust/issues/163926\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/shims/fs.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a7f9eb0c659de827220698b436055bfadb97cf63d726f461e125b0d8a2093b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this test is exactly the same as for \u0060_mm_cmpge_ss\u0060, but there \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":"tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cdd451ebf41c77505c7648d12e0403a47ce76673d5a36d1c69e92d6d5496ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this test is exactly the same as for \u0060_mm_cmpgt_ss\u0060, but there \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":"tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"626eaa59b92cfcbe5a81722ce7ab5988fc8f85f3e7ab45a0550130305bbd079c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this test is exactly the same as for \u0060_mm_cmple_ss\u0060, but there \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":"tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"89113ac8cb6b1ac66118f29635ae1296a53e9c7475faa1b7303bfea0e00b990c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this test is exactly the same as for \u0060_mm_cmplt_ss\u0060, but there \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":"tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"110d3d7aa3080c176276b68ecad5dc6362c7cc47af08f50d61bf48e5d7ac9b93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also add a test for \u003Chttps://github.com/rust-lang/rust/issues/66738\u003E, once that is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/issues/issue-miri-1075.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4799a6000b3fe52ede826143c20e814af603d3262041af0283a7d00bb194a2be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): The LLVM backend rejects float \u0060simd_reduce_{min,max}\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352a952b8299d4c5a444891e31e81eeed44e149eef5f534ab5014423e0d15e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): The LLVM backend rejects float \u0060simd_reduce_{min,max}\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1ec937e2dcd6797654dd5f49ec6d25434915ed60ba8c79e029e253183a370f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): The LLVM backend rejects float \u0060simd_reduce_{min,max}\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfab04aea2673ea977ef8331f196c2a61026591f6ad282dd3f3f4b26652cecda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): The LLVM backend rejects float \u0060simd_reduce_{min,max}\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"19398280c3e40163322b8490cedd16f193518d37935d65303a2d6fd391bb5651"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME move this module to a separate crate once aux-build is allowed \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":"tests/pass/function_calls/exported_symbol_weak.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346f7e1d6318456521bedaa813a7f0a39a3c611a2bb3a8b16801e750023bcc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): We cannot detect the deadlock currently. Instead, the deadlocked execution is treated like any other blocked execution. \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":"tests/genmc/pass/shims/mutex_deadlock.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99581c4b3ee95ff52bfc2851bb9fa5d9c133a92b17e87e62a30bca6c5422085"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): use \u0060std::thread\u0060 once GenMC mode performance is better and produces fewer warnings for compare_exchange. \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":"tests/genmc/pass/shims/mutex_deadlock.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cb8192ebc564d0c2380a70767431fbf258a51d5e268f616fadd40e76e2a344"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): Once the actual implementation of mutexes can be used in GenMC mode and there is a setting to disable Mutex interception: Add test revision without interception. \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":"tests/genmc/pass/shims/mutex_simple.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5158fefd8ef77c51dc53450b693a21ac80e1afab8d41d74297dedbbe798dc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): GenMC provides the \u0060--unroll=N\u0060 option, which limits all loops to at most N iterations (at the LLVM IR level). \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":"tests/genmc/pass/shims/spinloop_assume.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e472152376875746d12fce89ed8af58e36a5f138724cd7b567b0e737d3698b25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): Add revisions \u0060default_R1W3\u0060 and \u0060spinloop_assume_R1W3\u0060 once Miri-GenMC performance is improved. These currently slow down the test suite too much. \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":"tests/genmc/pass/data-structures/ms_queue_dynamic.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6587b7b26edf65f79650b7ba6dac61a8e02330b138b3a3d5f474ee9106d2c8cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): add 128 bit atomics for platforms that support it, once GenMC gets 128 bit atomic support \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":"tests/genmc/pass/atomics/rmw_ops.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad9c7bf037c8281aa3b74ce9bbf64ee8ecaec200c2ff00b67d83932db177986"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): The error message is currently suboptimal, since it mentions non-allocated/freed memory, instead of pointing towards the missing synchronization with the allocation. \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":"tests/genmc/fail/data_race/atomic_ptr_alloc_race.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1039e9ac5ec0837e5dbe8854a4600d8318284026839c70828b9a674e26458ac5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): We currently cannot show the two spans related to this error (only the second one), \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":"tests/genmc/fail/data_race/atomic_ptr_write_dealloc_race.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c212fff3174da6f9549bd39480ccf9df53a6c28d6c62429d81c2a385084a3d5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): once Miri-GenMC error reporting is improved, ensure that it correctly points to the two spans involved in the data race. \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":"tests/genmc/fail/data_race/mpu2_rels_rlx.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac947ccc3a3965db3b055f2613c6c5e4bde23dcf94abcd564e71ae72999eb42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): once Miri-GenMC error reporting is improved, ensure that it correctly points to the two spans involved in the data race. \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":"tests/genmc/fail/data_race/weak_orderings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ad36df677890b68d57a0d1d7ffe1beadcfa2c829b87c0227dc7f9eac94068c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX HACK: This is how miri represents the handle for thread 0. \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":"tests/fail-dep/concurrency/windows_join_main.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bc864c228b3457a49f47b43155345bd99b910d26ee1677a09f988358813f7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: This test should pass! However, \u0060async fn\u0060 does not yet use \u0060UnsafePinned\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fail/async-shared-mutable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b4bf900b126bff2356aa145a5aeb588453396116663d98d1c876bc915d007e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ideally this should also be involved in the error somehow, \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":"tests/fail/tail_calls/signature-mismatch-arg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"245dea1e0b1b9f22a14198b30a1a64141015c0f5e70d98e5be03c3d37d6c5725"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: test is disabled for cross-compiled targets because it fails to link. \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":"test-cargo-miri/run-test.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33dcadc4d1834797d60bd1ca894bbc28512d58351842c16ffefc1e2dc86b8e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can we prefer the one from the sysroot? \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":"src/helpers.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"52be244baf57a9dcc42ffbc721353ef5c8e428c95d850ea4a8f4fa157494431a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59cc396da688e8faeb265c9f563cd68507c113438457db48a1392849398a9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7668d2a1cdbbe0175bc9acb494c2f0684ccf70b86e46b8d20bad3fbfe905a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5430d4f97251fd499fda759400be08eba0155b61de6850357e10734c1f5fbc59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca8684abd614c7d98933930c4fd3cda47b76ef86b3be5ee6fe906b0cc8d86cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e756b1d8765e1bfe7548af7286a094df4ff3a4a4cb6b1cd3766d4ab70818f17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"989815d0a7ac324e40cdcd6274ee4221f14788d17298c5e3734f95d5435f3d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result. \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":"src/helpers.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc0ad18d2c4667291bd977db0bf9d7e224d3a0cf5b9967e1fbd6c8f82410fc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): Do we need to set splatted here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec13fd26ea3898715c54d72e458184aa445487e4dd767bdfd2c92b6e21d89af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the current logic here is layout-dependent, so enums with \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":"src/helpers.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9598a4de2a85e06af14b59d27d9f41d46f8d0c8c55659789a76bb4826520536f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are re-getting the allocation each time around the loop. \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":"src/helpers.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9216f18ba310a44f9770349b5a955004e16545e77f8dfc077e6124ff9e2f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are re-getting the allocation each time around the loop. \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":"src/helpers.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833379a2e3ba7ab47dea1da9e180d50b68e0de053464d51e4db56f0679d90ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Disable some passes to make higher opt levels also work. \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":"src/lib.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"53df4c6d72fd9d1b4dcfbc8fb55145800bf3f5ead8a28be86d9e091a81814ed4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should \u0060InPlace\u0060 arguments be reset to uninit? \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":"src/machine.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2db2c02326ee1a07a21bfa957a7084b3368db0b8a843d7e0037357d9d2c728"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should \u0060InPlace\u0060 arguments be reset to uninit? \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":"src/machine.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dd790c6aa2494f7162c51837e0a13d6a011ef5edcb5cd39672e5b4740797dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should \u0060InPlace\u0060 arguments be reset to uninit? \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":"src/concurrency/genmc/shims.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f5e79b4fe5fe4980db3a39f91378af47c9c1d44c2ed892088660b8d47cb861"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can we somehow preserve the immutability of \u0060ptr\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/machine.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d22f4d55aff1d756a574a3f8569cb8e4ae89772c0d21e39df3beaf7bab83c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///         todo!() \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":"src/machine.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc5e6aec1ae47c6001c7bf026531a445fc374b0952ac98400bffd32df0f06bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also disturb zeros? That requires a lot more cases in \u0060fixed_float_value\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/math.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a857210d27cad2c5b2a29fb84c25b8f5adac93d3922406d720940a224876c59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not nice to read the type from std but we don\u0027t have a good way to construct 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":"src/shims/backtrace.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e89ddde156068aa447e510bb3a757ad1d959e7bf4974dc6bd2a46944ee75dfd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: enabling this with genmc causes test failures because of how \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":"src/shims/extern_static.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ed1222e9c6921c2570fff483aa5e9b9bb24941b655c1b51a17a36ff04ae40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this can block on the host, halting the entire interpreter. \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":"src/shims/files.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d0d9175b6077dc9a9bad769acad8aa7b5a084aef6c62742893899df3dd035e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should return \u0060false\u0060 if this is a named pipe... \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":"src/shims/files.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aad5d12fab871c60c4ec65c635066813a209ff858e40bb3cdfd539294d13f86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: avoid allocating memory \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":"src/shims/foreign_items.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"049345ee045fd1719e94a81d749e58ebe5bd5a4d71a1b1ebc386966db73aaa27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The first argument is actually a function pointer. \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":"src/shims/foreign_items.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fabca70ff14833b3e5463f2235d72cb4c290736f07f567e7c1030f08354fe7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/foreign_items.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc84d719df1ae9dfa33f9245b3d90cba90eb5d69beedf66e8a36da292350cea2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2b63f5cf7d4b4924bf3364900baf355838fac64907fcd17ee60a77eda4ded0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa30d7948ac20e85d6b1fbcf9e95165a50feee260a1dd4afd31380cf62411f67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6fc4f06515a1457f337593f612c50dfa4414719c83defc0b061904db05d398"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"801c9148d78614fd8fb46887accb8086a885011a1f80670a535dd1d13bba3ae9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bfab6e58483043afbc88b82bc041faf90475ff7d727e09931a74ea033ca78c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf96bbd288b62d1f907f5b73b11fc6633195500a53d386784812ea6cf1fca7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efcf9a2c956a8efa96acc1aede267f7a69220afc3c421f9ec9c30c766ca9ebf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7506655f6f4919c50b616c630e1a36f333d603376a0930bc01477cae46cc7019"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc61bc72c72e7427a650283e3c2f9e8703c203b7931a0dc0089289c4fc418b3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af9669d614b2a0c97f917e63d83eca0ecdc3c8f2ef50266669bdd5b81447bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2536a012a03a5803de7739a55e0f55b91006402806d43db3d461331ed0101cb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ee6d98af846d3206ad65918cc64d2f566a8c9d6254cea4e0781f61b2229a2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54a2b3ede0c54cde60b16936506e8ace0779ccf0aad8133a7c9c7fbb65c4a09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d46196fb6a513d1e12912c9037238b62ca22c53efda97f668895dffb20d858"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39baa87391f9c522ad38b769b97449bca798e19c12fad755de68bdd6d99f26a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"832dbdf309dadc0fcd92045e90932c10caad56ebc81a743e13cf81765061dd5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff00a2f94aacf381eca67b5716369d58f1e9449698e082bc8b5b59b546ca1a02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab94ccac0b841b4d0e6a41468cee4187ff4771675b1fdbfbb8bcbbadc78f638"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490fd7146259afd67633ccc1128718dae5ba21eb4849937bde33ea2ecb55f40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc9df89b4ab836b3c7df49d397c7b5482132216e1bbef630e4a4c86e68290eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfeb4cbffa2311e810ae456327510935391cd51fe21e28e90be0458f21fa7c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21708210e43d937a513e77a308a9c0a7a8027de429126e2ae6b5f836b4d505"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"b480555bd9b2f0faae303b314b5a549298c3b9c0e76ba47955f148aa9daed3f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c52219c0f8dfedcb437d2123b6a81148d94026e392edbba9536ecb129f883f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af992e1869996e8cf9a488cfec16c08051cd634e8bae42e2f836d5573f7495c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"394a90d6283fe8f9f3c6f0c444f25377e76bc7037757e8173c96b501486fc30c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"346e1da904fa4d6d0a93a52bc165bc3a9e569c00107622d55c8f2f1131d227b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"283c0001d843e678a01ac58483242a4b1d55679698995f338c2006e4b8a82ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf226384b3140a5105de7d81fe15ccecf442b647ec6567fa278ac1687b17f50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa902491e7bca4348c845e4351962cd3bf2d2241e713ce8d6c9313948b02e02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/foreign_items.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51ac382f03811df3377fced4b03fcad8e6f12e7dabf00aa791a02e8077bc3d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bbecf5238da900f858bba81691715a5444e61f88dd9332e0442ae2b56b8b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e286952d271c1d962dd54117e3d1481102df97efffd7e7f29ccf939d1af345"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b9275aeae9f5948207dc4137c2ad4e09c8e870002ba3f3b836fd3e2efda8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a965a02811158e227b039801fbe03578bbd0b86243c930817051783e0525fda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e400aad79046f98cfa4484f1f5c9b96673fbf5b16c6591e7af8ac0add3c897"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"46290a07cb15d62ae646498dd32c61c5a542f90d6cd9240a880b586671465cf8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7765f6d05e6ce7c9d16e48e5fd431988adf8d63b8aaaca16dbe39520d0ee48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a82b18f1d233aca28a4f3304e13ca042f711c70a89def4b38cf42a7000c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66c4f6bc208ce51883da433fd258978bcacb46a9adafb6af46f8c5e0bc68ff8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec59c64d3c2cdbe4ec4f7a2662e233e3b0994ca6d81bd8cac3a7e5e2ab30a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is this guaranteed LLVM behavior? If not, we shouldn\u0027t \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":"src/shims/global_ctor.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e704ca360a1dd9af5acfeb273bebf3b96bb10ade1cf0719f1aae16fecc6a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for \u0060.init_array.N\u0060 and \u0060.ctors\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/global_ctor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f4ce6dbc2c297e85a9f433d856d3a5cbdee29e1d9132677a196b25cc1dc03e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In the future we might want to support more data types, \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":"src/shims/readiness.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"595e1bfbbcde35462617044f2636e16f5403dd61683b91fb1b27df8837c7a5f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we do this even if the readiness did not change! \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":"src/shims/readiness.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da5a5020474f83ca513dd247740b0c6e3bcf14e01f8dbdf7d61685db92b41c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the future, we might consider randomizing destructor order, but we still have to \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":"src/shims/tls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba04b01a546337628422cc32732a0ea838efe393aa1f247176f55183a579ffe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Technically, the reason should be \u0060DLL_PROCESS_DETACH\u0060 when the main thread exits \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":"src/shims/tls.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d82cb01c33e45fc7e900588e13671a1ab691d87044fc4e416179bfa5482112f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060h\u0060 should be a handle to the current module and what \u0060pv\u0060 should be is unknown \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":"src/shims/tls.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee3399cad55ffc7cbf2cffb765c0fe63697d84458fc1ecaa1fdfda783f47c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should run the destructor here *for all threads*. But that\u0027s non-trivial and std doesn\u0027t need it so we bail out with an \u0022unsupported\u0022 error. \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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"801567a2095a4edc61071597f0382e8132b77cef0b0cb196946db9197984db47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME validate the module! \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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3c179940ebd4e784c06dad06ca469a08427d2c07ca5290bba04c9bad1dfab0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use non-lossy conversion \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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"4706e0d7dbb9df238eb6dea7d38126b12a847ac929215485eedac758fcf1b135"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should return a nonzero value if this call does result in switching to another thread. \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":"src/shims/windows/foreign_items.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7df00994a6451d72bf2d699f91f35f2424bcbc04372daf4044084bd934d390f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could probably use \u0060OpenOptionsExt\u0060? On a Unix host, \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":"src/shims/windows/fs.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5025d173eecb8340d0f41407934e2dd0945c4a7343a5b825ec5f88ad4ffadfc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we are on a Unix host, short host writes are still visible to the program! \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":"src/shims/windows/fs.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a94d8eb4e9ff393d82fb13c57908421db9168abc1f521560dbd271457df41c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we are on a Unix host, short host reads are still visible to the program! \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":"src/shims/windows/fs.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7bdd90337f70d64a15091cef6447ac605a8a3c3bfaf72c9be2c2ac478ec0e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Which of these are POSIX, and which are GNU/Linux? \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":"src/shims/unix/foreign_items.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a61321ef07188b5223626a445911c3f9aaac4aa24f7d30de339696848ca4621"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe we can retry based on the error code? \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":"src/shims/unix/fs.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"80953a8846d07439ab7016cb205524e09db715c6f685427e0e11e7c6becab7d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe we can retry based on the error code? \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":"src/shims/unix/fs.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"01153c26e3d5af18a86aeccf0516c79f9d1954773de05d927c53fa5cf156ff13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Provide more fields using platform specific methods. \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":"src/shims/unix/fs.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a6010485fa816bbfd2d30605bc735b5176e6365ae622a6c0c59bdf0f175ed1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Detect and report the deadlock proactively. (We currently \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":"src/shims/unix/sync.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9dfafaa4358810d0efd86af5824cd7068398bf91e3e992a69b1655c08b4082"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This would not be needed with \u0060replace_with\u0060, but sadly \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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03133ddf658f1b398d13b62e18ccc0af33522ddbea36b216a0e57e083066aa8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On Windows hosts \u0060getsockname\u0060 returns \u00600.0.0.0:0\u0060 whilst the socket is connecting: \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":"src/shims/unix/tcp_socket.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9304c605903bb8877e8cd030c1d7a58bc125f2ba93c7da25d53d3a465d1a7271"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement reading the thread function\u0027s return place. \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":"src/shims/unix/thread.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"361f8689cf28ddf69a1707ca67b9b87e51640dd0a9a6773b9cc18145c5518b89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should use the program name if the thread name is not set \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":"src/shims/unix/thread.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cd128351a24885bd7e33ef942361e2489b79f0f6d42af95cb560fa3b76c030"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can randomize the order of unblocking. \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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d6c9c3180e0ad5b18f28b20e898b44f081a03aea7016b9c9ab6a46384373c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can randomize the order of unblocking. \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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dba17f2c353087fa995bfe39e2a3947c4e606937fa5ffba5bc2b5a30085127"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can randomize the order of unblocking. \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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5feaf54d92cb99a4a49c1eba9614a5fb24017f150b59e6ed1bde55e86ebc38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can randomize the order of unblocking. \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":"src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a6ef09065f35cef9eadc395fac58e913f9c8aa54ab40730b5cd2c919f0c413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can randomize the order of unblocking. \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":"src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2fbd8d7a64117704d61818694948e5db6e41ab8c95696c860d323ad9501695"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should return EBADF, but there\u0027s no nice way to do that as there\u0027s no \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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fccc3c0a7f7cb6a3774959f1514945921d0e2909ac4f86122363bf78ec5d3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this over-synchronizes; a more precise approach would be to \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":"src/shims/unix/virtual_socket.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c871327535e553aea9f6b5bf3953b69a405884618a852634e8fa02d36059e28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: synchronize behavior on lock copies/moves with macOS guarantees. Apparently there \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":"src/shims/unix/macos/sync.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9969e996593ecb00874e215e865890f824c9d78819413363a23d0050f2c075"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do these all have direct tests (#3179)?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims/unix/linux_like/syscall.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3987f475778d4dbe00048e4b165b413071ca425bd02661cfa8aa1b563dd1a48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use gettid? I\u0027m (LorrensP-2158466) not that familiar with this 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":"src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e118500e56ee52d4ea806bf720e075a5c65cf194ba1a27a68dc036e19f67b026"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a hack! \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":"src/shims/native_lib/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b436b05ec45d67d03cdd4a98b2b695debbcb83a762488e86c6b1d3273f1dd04c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unions, etc. \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":"src/shims/native_lib/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e2ece3e4dac04091e558cf062291704a6d4bd52cd222cff366c931f6d86c29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Certain non-C reprs should be okay also. \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":"src/shims/native_lib/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c1fdfce030a40bb3e37dcfcda1201a988a3f674e1237dc68faeb11cc5098f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Much of this could be reimplemented via the mitosis crate if we upstream 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":"src/shims/native_lib/trace/child.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"149c6df91537f7aa713b1b6885b9baef37bd95070b43fc81754039b921dca82f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe use clone3() instead for better signalling of when the child exits? \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":"src/shims/native_lib/trace/child.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc5c1f6a962fe9c7b923b1267c1172c0703b5b24eb1c33a21810f34b78dc407"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could be made certain; either determine all cases where \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":"src/shims/native_lib/trace/parent.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cb65754245d3cc68f8aeb85c343016cac0aab21923ce78eaef3d48ad2403bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128) \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":"src/intrinsics/math.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8431a46624437a328371c7dabb831fc05b4f78f93e40f7531c3c00050dec3eb2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128) \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":"src/intrinsics/math.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4711a8079496207131f5a97e2034b38d25a1bda35aa5d1251947502f51ebda0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128) \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":"src/intrinsics/math.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e838af30cf5d5e50615ba8a6105cd4cf88cf87e389bb24052def80226bcc9803"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128) \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":"src/intrinsics/simd.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"658f6996758558e2dc0248c74d775b6a62cad498f576c473fddb1ec42c909dad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we check for validity here? It\u0027s tricky because we do not have a \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":"src/intrinsics/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27009f81b4640c3a5e215f6afb320e7854789422dbb6e5306d4863fbd1e055"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060truncate\u0060 method on stabilization \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":"src/intrinsics/x86/aesni.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c64c71545850a745876b0fa9be1f236274933a2f54be5423422179a4fb08d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: derive Eq for AllocRange in rustc \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":"src/data_structures/range_object_map.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac60a39011a23e32f20539de6ac55c52d4726cdc384d401aad59f34d4b73eb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add a last() method to AllocRange that returns the last inclusive offset (end() is exclusive) \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":"src/data_structures/range_object_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7df937e6a54b393dfc35fa5e2d57406ba2f11479e8ec472112366e7f7eed0c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make Size::from_bytes const \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":"src/data_structures/range_object_map.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fea55e78d5578b797066132ad995338d737e061e4970afc568f9c53a06e25a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it is probably better to have one large RefCell, than to have so many small ones. \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":"src/concurrency/data_race.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2282a699c57a2e46d819d37a0e4a2bbdabd8595234e79b20ab06653a5e622e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// threads (FIXME: why?). \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":"src/concurrency/thread.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a275c1ebd375d4e228869bb6e04dc0e2bf2a81b0d6c6076348e153e21bb9bd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently, we cannot represent partial initialization. \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":"src/concurrency/weak_memory.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4696c3866bbd3a969c421fac10f21fedd35a7c449e9a38dc89858a0bd386ecaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we want an inclusive take_while (stops after a false predicate, but \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":"src/concurrency/weak_memory.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9b9221e1b6156ca9d734b87f73f735bd9501ffd8eecaf1d642cfbe90eb243"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): should this be on by default (like for GenMC)? \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":"src/concurrency/genmc/config.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"25febb0b366aad4441ad83d487e56be8a6124dfd009310c8a04a164375b57fc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): Remove if non-64bit targets are supported. \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":"src/concurrency/genmc/global_allocations.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ddce4857562705e3d9576d41ace83ccfecb5b2c3584280604ebf9c3d2d91e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): We could provide a way to changes this seed, to allow for different global addresses. \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":"src/concurrency/genmc/global_allocations.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"def792870f5182b77991d8d03cd584e02e0e7921bbbb7f023080f3a952710378"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): improve error handling. \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":"src/concurrency/genmc/helper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42896a1c9679b89db8fc6884fe2d214db430c5f2124f5d7c3b5009feba8d5ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): Add u128 support once GenMC supports it. \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":"src/concurrency/genmc/helper.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbbbacd2d3756ae16e9dcd8f4d2968995bf958aaaefd78e20a2fb3c094b8f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,borrow tracking): Borrow tracking information is lost. \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":"src/concurrency/genmc/helper.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d09d87173a31d757d0f28a06e81166603477d7b09baa05f9b31c74fa67725b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,borrow tracking): Borrow tracking not yet supported. \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":"src/concurrency/genmc/helper.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"150e12aabd0853e599a0b31ba9559a20a5083288bebbab811fc087befe4ede82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,tracing): Implement some work-around for enabling debug/trace level logging (currently disabled statically in rustc). \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a166af8e39484e0eef09b85899d7fbdee02ba8cbc17e778e9a536945a1d9be2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(genmc): implement multithreading. \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d4a98102f76ccbe32a30fe9370ad9c639b091417169da1977f034a55bd934"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,symmetry reduction): pass info to GenMC \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":"src/concurrency/genmc/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff77f83b887e76259737ab1e2cf0d28463c6d5b84175cc61ac8faa4e9257cfbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): implement multithreading once GenMC supports it. \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":"src/concurrency/genmc/run.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20d26747311839d7048bbda6602c080638dad2f00b747823561b9eb9c575e59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): check if this assumption is (and will stay) correct. \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":"src/concurrency/genmc/thread_id_map.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd0be96c7a1edcd877286e65169b2b8f6d7618dcc91f56d04a6aacfdd8cb88a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: with \u0060UnsafePinned\u0060, this should do proper per-byte tracking. \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":"src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1756078202d60b0828adcb8873768a32a74f572ef2843193f9664514d2216762"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(TB-Cell): It is unclear what to do here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/tree_borrows/perms.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8928220938f40eadb02c465689d7511b37212a0940c5801815e117540096729"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bench to compare this to FxHashSet and to other SmallVec sizes \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":"src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ae5571afcc28c26f035613c881fcd43b9f7e3610b4523ef196811ca53b350e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it should be possible to GC wildcard tree roots. \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":"src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f334fd604285a73d02543d7b2b98a3a53dbf68c8426ee68d809f941bd9e09e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can this be done cleaner? \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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ff15b21f7dc441cb0cef169ce445c4d9430f0e7b5d2cb8b1aa9948e59c02fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): Ensure this is still done in GenMC mode. Check for other places where GenMC may need to be informed. \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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a5cdf490aaa979da30a4b4916fbe504533d393cb91ccf76ccc51a3e47888d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we cannot determine the size (because the unsized tail is an \u0060extern type\u0060), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dbd11bd688916802e11e1842ee90f5246c35f911e081de6f8bf2cf8ea6bede"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this can lead to threshold effects, we should probably add some form \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":"src/alloc/isolated_alloc.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68969f7e682d5257adec1f5555338f70de191c6015a69df018324edf0036a3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add restart and other post-exit commands, similar to GDB and \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":"priroda/src/debugger.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc031c80121458bec01aa410fcf9f2361dcf704f419077f4c95dd9af8ef2f15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: validate breakpoints here so every frontend gets the same behavior. \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":"priroda/src/debugger.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"32012c535afc4f1848c6d9998be3683fba234c719a81d5d9e2a79b2c8e3df1d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Preserve \u0060TerminationInfo::Exit::leak_check\u0060 and run Miri\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"priroda/src/debugger.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8f88fc68c7e5486f39ddf4368aba215e1486273e0bd5492008b7f6436c4f3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use a Miri-owned scheduler-aware debugger step API before \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":"priroda/src/debugger.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"18041de60d221da773202518f5fbf1bf6027f2a7a5ff7f0cd7e2f775b5232a12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add coverage once Priroda supports printing dereferenced places. \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":"priroda/src/debugger.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5972cb606c5bea963b82deb395a2592b0d4c729dd7da81a551126ea40d204803"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: teach the leaf renderer about simple Rust scalars (\u0060bool\u0060, integers, \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":"priroda/src/debugger.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"836c0f07f5646b594e540278b8ca4d3145406c7bf8bb3313104bf2b2794884f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: decide how much dereferencing belongs in this renderer. References \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":"priroda/src/debugger.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ba11299089789b015c5da96a949bc50e9322b5c5e95e78949da6d3a94652a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: replace this fixed recursion limit with a value-size/output-budget \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":"priroda/src/debugger.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04e9455ce4fe8e8017f8438c1f999dcbc818228bf14b0c41876265842b10f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support unions only with an explicit user-selected field or \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":"priroda/src/debugger.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d30423ef59c0346735399724d2197075e03a0ab6a3b871f0c27054b780d4380"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: expose this as an explicit render error when \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":"priroda/src/debugger.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0277bbbb5c0660563b6780047a60e4b787605dc407d2f781e1840e27ed6e16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: distinguish invalid/uninitialized discriminants \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":"priroda/src/debugger.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13047df221d111432433b6c0681ef0618b287f845ca9e800d335b13897be20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: preserve the successfully rendered fields and \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":"priroda/src/debugger.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d487f863af17fa270f1c0de7bfa343744c4b4f7d94464061f4281e2c2370b9b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: render tuple fields independently so one \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":"priroda/src/debugger.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"781addba865415940dfee1733e93af82e320a4d55540c8aff33789e23d1b595f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when slice metadata is invalid, show that as a slice \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":"priroda/src/debugger.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6751bbfebc81cea29ae62fef74342838efae68a37b15b9b18f426b4cc330a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add an output budget/truncation policy before rendering \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":"priroda/src/debugger.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a1b0a9edc7b9655eacb8c8a43a514a1749f5e9db3f12778a10d53b4c351a99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: keep already-rendered elements and mark 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":"priroda/src/debugger.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5cff29552d7a9ae9db8fb5b591f72d4d92dc70fc295638094a7c5ffa891f38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider source-shaped special cases for strings, closures, \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":"priroda/src/debugger.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eed96a1939e02aaa568bc5dcdbccd1118a73023dfc029e473887ffbc3479bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This seems wrong, it ignore the frame. \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":"priroda/src/debugger.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6276bb181f41e63f1bb4af50cdf6aa84b84bbb042dcff4f481b71f119a9f61ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Finish classifying \u0060var_debug_info\u0060 by keeping the source path \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":"priroda/src/debugger.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6991783450ab35d6cce2f067440a99656c8b3f9cfc9197e28c1d030a6213507"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add pending breakpoint support later if needed. \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":"priroda/src/debugger.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2c09a76a5e075b9a8b55c4ead8a1bfc65bb95ddf96b6c5c4b5474e22202beb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: distinguish terminating the debugger session from disconnecting a \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":"priroda/src/debugger.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c65681a9cacd8b2a0c86b2d4b548e452494aba30bfda1eb66c166e0247e5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle the same \u0060-Z\u0060 flags that Miri accepts. \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":"priroda/src/main.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86b23c6bd78b76bb989410560909fc199cb79216a23f140c82aa4c3024cc187"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support non-bin crates by listing functions and letting users call them with manually entered arguments. \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":"priroda/src/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab128deec29d60ebbdfa053667b70d64b32f5befea76dacb15ba4399388fe94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: share Miri launcher configuration so interpreted programs receive \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":"priroda/src/main.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f442ad9e7e718f1b74e9da2c12933e527e5fc3d901fac17b71b1fd34f9407f84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report interpreter initialization failures instead of panicking. \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":"priroda/src/main.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe9ca444c70b3bd5f7770b31aed2713e7531ec6ca457e6f76fb1057963498c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: look at the Spanned crate for how to easily produce errors in \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":"priroda/src/frontend/cli.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"932782c391866712dd030105c72bf8bd9fcb977cda1613867c41f82830f84050"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we need to distinguish malformed input from the unknown commands by returning useful \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":"priroda/src/frontend/cli.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7544b28f4cbd904bfe15267afe0ab9d800af919879d20142e4c82103cc4292d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: empty line should repats last command user typed not exeute specific command. \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":"priroda/src/frontend/cli.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c7279f70604e398b4e23b7ab04bd24757bdee69a7dcc99861ceec55aeeca97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: return a typed CommandError so malformed breakpoint input 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":"priroda/src/frontend/cli.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2caca015b39d5f806203f676fec8a3ced7b52fba9b25b842d3f84b13382c889"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: send a DAP error response once unknown commands are \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b758d1f37402f0ebf93f4b67ceb8882652257208a051d917c7a33aa156e43f22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: connect launch arguments to Priroda\u0027s session model. \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d4de2a9b1a7601f5d65099ba4497341445eb9ed2a29266cd34317bf2f51285"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: replace this with Miri thread state once Priroda exposes a \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4666c90a40d8139c5f1192135268495ef0946e7b40afc66f1e8769ca28cc4223"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: report all frames once Priroda exposes a frontend-facing stack model. \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856f0662c518378286abb32eb272563159b7babb71b7676f7bd3c21499e485e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: grow capabilities as Priroda adds DAP features. \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d7b3a819e9fec71a703612d320cb01aeb25057181d19a7aab2ed7f8bde87f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add child handles once Priroda can identify places across requests. \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":"priroda/src/frontend/dap.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"12951b581e8b468c68c03baf7122e4623d1879e0ee56490c755c889f6978ff79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc,cargo): Switch to using \u0060CARGO_CFG_DEBUG_ASSERTIONS\u0060 once https://github.com/rust-lang/cargo/issues/15760 is completed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genmc-sys/build.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"128db49e625d26eba61fe05a9097ea87101b842799921a1751f3a4eb69b5b6af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(genmc): rework this if non-64bit support is added to GenMC (the current allocation scheme only allows for 64bit addresses). \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":"genmc-sys/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1217ea1d7f05fb5ac1172532cb2da72ff0a45ef68d9540997d5339c78531f3c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(genmc): currently we use \u0060get_global_alloc_static_mask()\u0060 to ensure the constant is consistent between Miri and GenMC, \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":"genmc-sys/src/lib.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f823d2ffdf082f11104b3d039b99d600698f0b879668b3192af598d60a125"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(genmc): set \u0060Tip\u0060 by default once the GenMC tips are relevant to Miri. \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":"genmc-sys/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7c494928d46e787b87fecbab7d56287565ad2d534765b17c54f87ef06c381d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060has_arg_flag\u0060 instead? \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":"cargo-miri/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7193b70bb68f4fd507a10d18cc97ff3e34ba04228543099260d63ee234c357eb"}},{"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 \u0060Cargo.toml\u0060 makes this repository a deployable product (line 14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 15 project(s) overshoot their size bounds, lowering Project Cohesion to 8.7/10. The most over is \u0060(repository root)\u0060 (54250 LoC, 318 module-visible types across 27 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"0dbb915274563a1a1c7710b67a8c19d2a107f22fcaf0daddfce999f66be50e9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed65b9c95a4dc53898afcb477735e650c15707ac619af8959b21ca0939b1e0af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3519ccf925af4dbcd14b3786ec69d9749c93b8d8119faf42ed9457ac3bbeaa7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d14f53cc9214e5b6289d2370176bcea39877af14cc2346cfb6caa4a453f6e0f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fb40b264177e81e620318686d9f99566c5c9cb9145dbc9e645dfa936c26dbd8"},"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":"993c7ec993368047da89be3d99929536a06ed71c7aa4abbba844ce1fdb746f9f"},"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":"7eaf077c03fbd91c73adcdc82a996f29fe67b3e172190298656fdf55e909a08d"},"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":"38710a209a55e6fa83a8f67d33f56f4789889f58205637c883a4d3ab3d90b2df"},"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":"f83b43f1db5d7fa39a932acb78e6b542cfae8f0bd965c89532e26a42dddf5169"},"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":"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":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","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":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.2.3","advisory":"RUSTSEC-2026-0186","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":"2576178a4b41ff07b1ae2e678aa3ed6822e625b2dca798c00a604e3bd178ace5"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","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":"34b850950d925c9c53582ea97b9291e1d53c38e628e408d5eb895835bbce1aa3"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","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":"e505dd338b86f18aceff621a56640c0b6d44ebe076fe9bcb5670032d65c3918e"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 6 of 136 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; 136 of the 182 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: src/alloc/isolated_alloc.rs, src/borrow_tracker/tree_borrows/unimap.rs, src/alloc/alloc_bytes.rs, miri-script/src/coverage.rs, src/shims/native_lib/trace/messages.rs, src/borrow_tracker/tree_borrows/exhaustive.rs. 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":"src/alloc/isolated_alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f2e7024b36dbaef13900e161d56a1098e19295d1c2cd01db8ff9ca955f2c6a"}},{"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":"src/borrow_tracker/tree_borrows/unimap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19795796dccf0aafca6c9640f2fc606f1efa653567ff5695b0ab003f519cf33"}},{"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":"src/alloc/alloc_bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf104cbcf66879950402be06d731cb2df6c354430d829c22e2d216688a9f2b53"}},{"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":"miri-script/src/coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dcff896e9d168f0626c048e17e489e60787413f44cdc48228d4db2bf1e58d7"}},{"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":"src/shims/native_lib/trace/messages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e936bee76b4160aff7831b2818d8d488395066b778543077f3b6e2fcd77126"}},{"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":"src/borrow_tracker/tree_borrows/exhaustive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4806c4f611504658495dc1f347f592138fedbbe30399617cb3fd675786daa39"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/14 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060bench-cargo-miri/backtraces\u0060, \u0060bench-cargo-miri/big-allocs\u0060, \u0060bench-cargo-miri/mse\u0060, \u0060bench-cargo-miri/range-iteration\u0060, \u0060bench-cargo-miri/serde1\u0060 and 8 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ecx.machine.rng.get_mut() \u0026\u0026 (rng.random() || (len \u003E= BIG_ACCESS \u0026\u0026 rng.random()))\u0060 appears character-identically in 2 files \u2014 src/shims/unix/fd.rs, src/shims/unix/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":"src/shims/unix/fd.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceab8b2c61e6e547a8e12d523ea0e98ef6386731d937cc916ee1cfaf9918634"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pointee.is_unpin(*cx.tcx, cx.typing_env()) \u0026\u0026 pointee.is_unsafe_unpin(*cx.tcx, cx.typing_env())\u0060 appears character-identically in 2 files \u2014 src/borrow_tracker/stacked_borrows/mod.rs, src/borrow_tracker/tree_borrows/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":"src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a719d8da750aab9ec4375873b3df46ec5a922f74208b9371031178651e6614f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 188 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23997d12889a257e49163e04f7a02dd594016ad365110e63aa9ad2cc0632334"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 395 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"addeefb611efe6177f0f48601d7fa7e2e5469cdba393205475f5742e736e1b00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f092b71cdee98e436837ebb8020743e4f2bab58709474eb310de37d3b9acaa8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 437 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"da563ae792d6b709630bb94d1951c1e1823dbfb99a2d950f78b9c964556abb8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 464 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebe7c1c5534da4ff8d11b16db3f9572bac598e4e955e5e5ecef18058d70ff7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 597 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b877c30cd4595a4b2122f89b8b149a83c921a3a4ab28ffadfac9338cefbeba8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 658 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"020f80e17eb771f34bf4e6276f65fdfce7b50262df107a306dfc420881212ce6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 671 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd45ac4224dbc62efe3f5ae88fe66ab66c7f7e215e3d2cca68c2ce76fb4873b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 683 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313cce1413eb76d6f38bccd87596cb71423fae717058c4c6ce48125a49e33fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 719 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab26a9c87ce820d88f625b76fc7eba9c744f933842abe3ede3b68ca2406a88d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 744 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e8edda219c675e691d040b45acdf94922206c2dc6d5e7f5a481cfb015abae1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 783 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3c9317da2150162c8720e7102ae8e4abb37bc45924ef80d9512399c68157c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/run.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493a413c93a633a7122b5c8668316efd4b34ab5572b99ec7dc693bad6b10912"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 50 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/shims.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"11046dfc228508661c79751b528c6695d6ab21c365fc9b72f104614c2e612e7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/shims.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb03c2acf365d7cb929e8181f1890288fc7c90656bd00210db0c391dce3917f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 221 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/concurrency/genmc/shims.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e04df6f192514ecdafe9a84d97e4cc5c79ed85a1a1baad6ac0ed8efe32628e"}}],"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-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-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-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":"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"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":20,"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."]}]}